Stronger Inequalities for 0, 1 Integer Programming Using Knapsack Functions.
Ferydoon KianfarPublished in: Oper. Res. (1971)
Keyphrases
- integer programming
- valid inequalities
- cutting plane algorithm
- packing problem
- np hard
- knapsack problem
- linear programming
- cutting plane
- ai planning
- column generation
- integer program
- production planning
- set covering problem
- dynamic programming
- constraint programming
- network flow
- lagrangian relaxation
- binary variables
- set covering
- linear programming relaxation
- inference problems
- facility location
- elementary functions
- network design problem
- lp relaxation
- transportation problem
- vehicle routing problem with time windows
- sufficient conditions
- optimal solution
- dantzig wolfe decomposition
- upper bound
- linear program
- mixed integer
- set partitioning
- crew scheduling
- feasible solution