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