327 search results - page 8 / 66 » Cutting planes in integer and mixed integer programming |
CORR
2010
Springer
13 years 8 months ago
2010
Springer
The lift-and-project closure is the relaxation obtained by computing all lift-and-project cuts from the initial formulation of a mixed integer linear program or equivalently by co...
EOR
2008
13 years 11 months ago
2008
We study a scheduling problem, motivated by air-traffic control, in which a set of aircrafts are about to land on a single runway. When coming close to the landing area of the air...
MP
2006
13 years 10 months ago
2006
Mixed integer programming (MIP) formulations are typically tightened through the use of a separation algorithm and the addition of violated cuts. Using extended formulations involv...
IPCO
2004
14 years 8 days ago
2004
In this paper we use facets of simple mixed-integer sets with three variables to derive a parametric family of valid inequalities for general mixed-integer sets. We call these ine...
EUROGP
2004
Springer
14 years 4 months ago
2004
Springer