Complexity of branch-and-bound and cutting planes in mixed-integer optimization.
Amitabh BasuMichele ConfortiMarco Di SummaHongyi JiangPublished in: Math. Program. (2023)
Keyphrases
- cutting plane
- mixed integer
- branch and bound
- optimal solution
- integer programming problems
- column generation
- lagrangian heuristic
- lower bound
- network design problem
- combinatorial optimization
- branch and bound algorithm
- valid inequalities
- feasible solution
- cutting plane algorithm
- linear program
- worst case
- linear programming relaxation
- mixed integer programming
- upper bound
- search algorithm
- convex hull
- search space
- lot sizing
- mixed integer program
- integer program
- tree search
- linear programming
- optimization problems
- metaheuristic
- simulated annealing
- continuous variables
- np hard
- knapsack problem
- traveling salesman problem
- integer programming
- objective function
- tabu search
- dynamic programming
- computational complexity