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