Quantum speedup of branch-and-bound algorithms
Branch-and-bound is a widely used technique for solving combinatorial optimization problems where one has access to two procedures: a branching procedure that splits a set of potential solutions into subsets, and a cost procedure that determines a lower bound on the cost of any solution in a given s...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
American Physical Society
2020-01-01
|
| Series: | Physical Review Research |
| Online Access: | http://doi.org/10.1103/PhysRevResearch.2.013056 |