Minimal Inequalities for an Infinite Relaxation of Integer Programs

13 years 5 months ago

Download www.math.ucdavis.edu

We show that maximal S-free convex sets are polyhedra when S is the set of integral points in some rational polyhedron of Rn . This result extends a theorem of Lov

Amitabh Basu, Michele Conforti, Gérard Corn

Real-time Traffic

Maximal Lattice-free Convex | Maximal S-free Convex | S-free Convex Sets | SIAMDM 2010 |

claim paper

Related Content

» Computing with Multirow Gomory Cuts

» Lifting Integer Variables in Minimal Inequalities Corresponding to LatticeFree Triangles

» Cover and Pack Inequalities for Mixed Integer Programming

» On Lifting Integer Variables in Minimal Inequalities

» On the knapsack closure of 01 Integer Linear Programs

» On Generating All Minimal Integer Solutions for a Monotone System of Linear Inequalities

» The network inhibition problem

» Combinatorial Benders Cuts for MixedInteger Linear Programming

» Decomposition and Dynamic Cut Generation in Integer Linear Programming

Post Info
More Details (n/a)

Added	21 May 2011
Updated	21 May 2011
Type	Journal
Year	2010
Where	SIAMDM
Authors	Amitabh Basu, Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli

Comments (0)

Sciweavers

Minimal Inequalities for an Infinite Relaxation of Integer Programs

Maximal Lattice-free Convex | Maximal S-free Convex | S-free Convex Sets | SIAMDM 2010 |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers