30 search results - page 4 / 6 » Cuts for Conic Mixed-Integer Programming |
IPCO
2008
14 years 9 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...
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...
COLOGNETWENTE
2009
13 years 12 months ago
2009
Abstract Within the context of solving Mixed-Integer Linear Programs by a Branch-andCut algorithm, we propose a new strategy for branching. Computational experiments show that, on ...
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...