Sciweavers

SIAMDM
2010
105views more  SIAMDM 2010»
12 years 11 months ago
Minimal Inequalities for an Infinite Relaxation of Integer Programs
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...
SIAMDM
2011
12 years 12 months ago
On Maximal S-Free Convex Sets
Let S ⊆ Zn satisfy the property that conv(S) ∩ Zn = S. Then a convex set K is called an S-free convex set if int(K) ∩ S = ∅. A maximal S-free convex set is an S-free convex...
Diego A. Morán R., Santanu S. Dey