Branch and bound, integer, and non-integer programming.
John J. H. ForrestJohn A. TomlinPublished in: Ann. Oper. Res. (2007)
Keyphrases
- integer programming
- branch and bound
- lower bound
- np hard
- branch and bound algorithm
- column generation
- search algorithm
- optimal solution
- upper bound
- linear programming
- combinatorial optimization
- search space
- constraint programming
- production planning
- cutting plane
- lagrangian relaxation
- network design problem
- tree search
- valid inequalities
- branch and bound procedure
- network flow
- search strategies
- branch and bound method
- set covering problem
- max sat
- tree search algorithm
- beam search
- integer program
- cutting plane algorithm
- branch and bound search
- randomly generated problems
- np complete
- linear programming relaxation
- set covering
- objective function
- linear program
- approximation algorithms