327 search results - page 8 / 66 » Cutting planes in integer and mixed integer programming |
CORR
2010
Springer
14 years 10 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...
112
click to vote
EOR
2008
15 years 1 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...
110
click to vote
MP
2006
15 years 1 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...
101
click to vote
IPCO
2004
15 years 2 months 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
15 years 6 months ago
2004
Springer