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 ...
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 ...
[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) ...
Notifications You must be signed in to change notification settings This code is an implementation of Tabu Search to solve the Quadratic Assignment Problem (QAP) test problems of Nugent et al (20 ...
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 ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results