Valid inequalities based on the interpolation procedure.
Sanjeeb DashOktay GünlükPublished in: Math. Program. (2006)
Keyphrases
- valid inequalities
- integer programming
- mixed integer program
- cutting plane algorithm
- linear programming
- traveling salesman problem
- mixed integer linear programs
- mixed integer programming
- cutting plane
- mixed integer
- network design problem
- convex hull
- lower and upper bounds
- feasible solution
- column generation
- linear programming relaxation
- randomly generated problems
- facet defining
- facet defining inequalities
- integer program
- capacitated fixed charge
- lagrangian relaxation
- search algorithm
- primal dual
- lower bound
- production planning
- branch and bound algorithm
- multi objective