Valid inequalities for MIPs and group polyhedra from approximate liftings.
Jean-Philippe P. RichardYanjun LiLisa A. MillerPublished in: Math. Program. (2009)
Keyphrases
- valid inequalities
- convex hull
- integer programming
- traveling salesman problem
- mixed integer
- mixed integer linear programs
- mixed integer programming
- cutting plane algorithm
- lower and upper bounds
- feasible solution
- linear programming
- linear programming relaxation
- network design problem
- column generation
- cutting plane
- special case
- facet defining inequalities
- evolutionary algorithm
- integer programming formulation
- integer program