42 search results - page 2 / 9 » Cover and Pack Inequalities for (Mixed) Integer Programming |
ANOR
2007
13 years 5 months ago
2007
In this survey we attempt to give a unified presentation of a variety of results on the lifting of valid inequalities, as well as a standard procedure combining mixed integer roun...
MP
2008
13 years 5 months ago
2008
IPCO
2007
13 years 6 months ago
2007
In this paper we explore the geometry of the integer points in a cone rooted at a rational point. This basic geometric object allows us to establish some links between lattice poin...
ORL
1998
13 years 5 months ago
1998
Crowder et al. (Oper. Res. 31 (1983) 803–834) conjectured that the separation problem for cover inequalities for binary integer programs is polynomially solvable. We show that t...
GIS
2006
ACM
14 years 6 months ago
2006
ACM
We present a novel method for the automatic generalization of land cover maps. A land cover map is composed of areas that collectively form a tessellation of the plane and each ar...