Parallel Branch-and-Bound Algorithms for General Mixed Integer Programming on the CM-5.
Jonathan EcksteinPublished in: SIAM J. Optim. (1994)
Keyphrases
- mixed integer programming
- branch and bound algorithm
- branch and bound method
- branch and bound
- column generation
- lagrangian relaxation
- set covering problem
- special case
- combinatorial optimization
- lower bound
- network design problem
- valid inequalities
- mixed integer
- production planning
- optimal solution
- lot sizing
- dynamic systems
- boolean satisfiability
- integer programming
- approximation algorithms
- resource allocation
- multistage
- linear programming
- np hard
- search space