Branch-and-Bound versus Lift-and-Project Relaxations in Combinatorial Optimization.
Gérard CornuéjolsYatharth DubeyPublished in: CoRR (2023)
Keyphrases
- combinatorial optimization
- branch and bound
- branch and bound algorithm
- linear programming relaxation
- metaheuristic
- combinatorial optimization problems
- column generation
- traveling salesman problem
- mathematical programming
- simulated annealing
- combinatorial problems
- submodular functions
- branch and bound procedure
- lower bound
- beam search
- branch and bound method
- tree search
- network design problem
- max flow min cut
- hard combinatorial optimization problems
- optimization problems
- lagrangian heuristic
- tree search algorithm
- branch and bound search
- max sat
- linear programming
- vehicle routing problem
- np hard
- search algorithm
- search strategies
- search tree