A new reduction method in integer programming.
Harold GreenbergPublished in: Discret. Appl. Math. (1988)
Keyphrases
- integer programming
- reduction method
- np hard
- linear programming
- constraint programming
- lagrangian relaxation
- selection algorithm
- ai planning
- column generation
- cutting plane algorithm
- set covering
- cutting plane
- integer program
- leaf nodes
- valid inequalities
- vehicle routing problem with time windows
- knowledge base
- multi objective
- multiresolution
- training data