Complexity of Branch-and-Bound and Cutting Planes in Mixed-Integer Optimization - II.
Amitabh BasuMichele ConfortiMarco Di SummaHongyi JiangPublished in: Comb. (2022)
Keyphrases
- cutting plane
- mixed integer
- branch and bound
- optimal solution
- column generation
- integer programming problems
- lagrangian heuristic
- lower bound
- network design problem
- combinatorial optimization
- branch and bound algorithm
- linear program
- cutting plane algorithm
- valid inequalities
- mixed integer programming
- search algorithm
- feasible solution
- convex hull
- upper bound
- mixed integer program
- worst case
- linear programming relaxation
- search space
- integer program
- continuous variables
- optimization problems
- lot sizing
- integer programming
- np hard
- tree search
- objective function
- lagrangian relaxation
- knapsack problem
- linear programming
- special case
- max sat
- mathematical programming
- dynamic systems
- cost function
- computational complexity
- genetic algorithm