Hybrid Classical-Quantum Branch-and-Bound Algorithm for Solving Integer Linear Problems.
Claudio SanavioEdoardo TignoneElisa ErcolessiPublished in: Entropy (2024)
Keyphrases
- branch and bound algorithm
- integer variables
- combinatorial optimization
- lower bound
- finding an optimal solution
- branch and bound
- test problems
- randomly generated problems
- network design problem
- continuous variables
- randomly generated
- np hard
- upper bound
- optimal solution
- knapsack problem
- weighted max sat
- branch and bound method
- variable ordering
- objective function
- convex quadratic programming
- set covering problem
- upper bounding
- mixed integer linear programming
- exact methods
- lower bounding
- precedence constraints
- np complete
- max sat
- mixed integer
- metaheuristic
- quantum computation
- optimization problems
- search space