An Obliquely Angled Branch and Bound Technique for Integer Programming.
Heiner Müller-MerbachPublished in: Angew. Inform. (1983)
Keyphrases
- integer programming
- branch and bound
- lower bound
- np hard
- column generation
- search algorithm
- branch and bound algorithm
- optimal solution
- search space
- upper bound
- linear programming
- randomly generated problems
- constraint programming
- valid inequalities
- production planning
- branch and bound method
- cutting plane
- combinatorial optimization
- network design problem
- network flow
- tree search
- lagrangian relaxation
- beam search
- set covering problem
- branch and bound procedure
- search strategies
- set covering
- tree search algorithm
- mixed integer programming
- integer program
- cutting plane algorithm
- constraint satisfaction problems
- branch and bound search
- constraint satisfaction
- special case
- lagrangian heuristic