Abstract: The Quadratic Assignment Problem (QAP) is a well-studied, NP-Hard combinatorial optimization problem with practical applications in timetabling, scheduling, logistics, circuit design and ...

Fuel-based generators are the primary source of electricity in power engineering 1,2. A challenge in this area is the Economic Load Dispatch (ELD), which deals with properly scheduling a group of ...

This paradox—theoretical efficiency without practical improvement—left the optimization community in an unusual position. They had mathematical certainty that efficient algorithms existed, but the ...

Identifying the rank of species in a complex ecosystem is a difficult task, since the rank of each species invariably depends on the interactions stipulated with other species through the adjacency ...

In this mini-review, we introduce and summarize research from the Quantum Technologies Group (QTG) at Carnegie Mellon University related to computational experience with quantum annealing, performed ...

Designs including tens of millions of standard cells in one chip are commonly used in current IC projects, so finding optimal location on a chip surface for each logic cell is a very important step in ...

This is a Python implementation of the Doubly Stochastic Projected Fixed Point (DSPFP) algorithm for solving the Quadratic Assignment Problem / Graph Matching..

[Ahuja00] “A greedy genetic algorithm for the quadratic assignment problem”, R. Ahuja, J. Orlin, A. Tiwari, Computers and Operations Research, vol. 27, issue 10 (Sept. 2000), 917--934, ACM (2000) ...

Spreading start times allows school districts to reduce transportation costs by reusing buses between schools. However, assigning each school a time involves both estimating the impact on ...

Quantum annealing algorithms belong to the class of metaheuristic tools, applicable for solving binary optimization problems. Hardware implementations of quantum annealing, such as the quantum ...