53 search results - page 1 / 11 » Minimal Inequalities for an Infinite Relaxation of Integer P... |
SIAMDM
2010
13 years 5 months ago
2010
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
IPCO
2008
14 years 12 days ago
2008
Recent advances on the understanding of valid inequalities from the infinite group relaxation has opened the possibility of finding a computationally effective extension to GMI cu...
IPCO
2008
14 years 12 days ago
2008
Recently, Andersen et al. [1] and Borozan and Cornu
ANOR
2005
13 years 11 months ago
2005
We review strong inequalities for fundamental knapsack relaxations of (mixed) integer programs. These relaxations are the 0-1 knapsack set, the mixed 0-1 knapsack set, the integer ...
IPCO
2010
14 years 13 days ago
2010
This paper contributes to the theory of cutting planes for mixed integer linear programs (MILPs). Minimal valid inequalities are well understood for a relaxation of an MILP in tab...