A characterization of minimal valid inequalities for mixed integer programs.
Achim BachemEllis L. JohnsonRainer SchraderPublished in: Oper. Res. Lett. (1982)
Keyphrases
- valid inequalities
- mixed integer program
- integer programming
- mixed integer
- traveling salesman problem
- feasible solution
- cutting plane
- mixed integer programming
- linear programming
- convex hull
- lower and upper bounds
- linear programming relaxation
- column generation
- continuous variables
- primal dual
- integer program
- linear program
- lagrangian relaxation
- lot sizing
- binary variables
- tabu search
- bayesian networks
- knapsack problem
- constraint programming
- np hard
- search space