A hybrid branch-and-bound approach for exact rational mixed-integer programming.
William J. CookThorsten KochDaniel E. SteffyKati WolterPublished in: Math. Program. Comput. (2013)
Keyphrases
- mixed integer programming
- branch and bound
- column generation
- branch and bound method
- lower bound
- network design problem
- search algorithm
- branch and bound algorithm
- search space
- linear programming relaxation
- upper bound
- optimal solution
- lagrangian relaxation
- integer program
- combinatorial optimization
- cutting plane
- valid inequalities
- branch and bound procedure
- lot sizing
- decision making
- production planning
- mixed integer
- integer programming
- tree search
- linear program
- lagrangian heuristic
- knapsack problem
- linear programming
- neural network