Improved integer programming bounds using intersections of corner polyhedra.
David E. BellMarshall L. FisherPublished in: Math. Program. (1975)
Keyphrases
- integer programming
- np hard
- linear programming
- ai planning
- network flow
- column generation
- inference problems
- lower bound
- constraint programming
- cutting plane algorithm
- upper bound
- special case
- cutting plane
- set covering problem
- production planning
- facility location
- dantzig wolfe decomposition
- crew scheduling
- valid inequalities
- vehicle routing problem with time windows
- support vector
- integer program
- lagrangian relaxation
- set covering
- branch and bound algorithm
- worst case
- linear programming relaxation
- approximation algorithms
- dynamic programming
- optimal solution
- integer programming formulations