Valid inequalities for mixed 0-1 programs.
Tony J. Van RoyLaurence A. WolseyPublished in: Discret. Appl. Math. (1986)
Keyphrases
- valid inequalities
- integer programming
- traveling salesman problem
- mixed integer programming
- linear programming
- cutting plane algorithm
- feasible solution
- cutting plane
- mixed integer linear programs
- mixed integer
- lower and upper bounds
- integer program
- column generation
- convex hull
- randomly generated problems
- linear programming relaxation
- integer programming formulation
- capacitated fixed charge
- network design problem
- primal dual
- facet defining inequalities
- lower bound
- continuous variables
- lp relaxation
- production planning
- branch and bound
- tabu search
- upper bound
- special case