## Quantum Annealing for the two-level Facility Location Problem

Article Download View Quantum Annealing for the two-level Facility Location Problem

Article Download View Quantum Annealing for the two-level Facility Location Problem

Tai256c is the largest unsolved quadratic assignment problem (QAP) instance in QAPLIB. It is known that QAP tai256c can be converted into a 256 dimensional binary quadratic optimization problem (BQOP) with a single cardinality constraint which requires the sum of the binary variables to be 92. As the BQOP is much simpler than the original … Read more