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