205 search results - page 19 / 41 » Valid inequalities for mixed integer linear programs |
AUTOMATICA
2006
13 years 8 months ago
2006
In this paper we show that the problem of optimal mine planning can be cast in the framework of receding horizon control. Traditional formulations of this problem have cast it in ...
IPCO
2008
13 years 10 months ago
2008
Abstract. Semidefinite relaxations are known to deliver good approximations for combinatorial optimization problems like graph bisection. Using the spectral bundle method it is pos...
COCOA
2008
Springer
13 years 10 months ago
2008
Springer
The problem of interest is covering a given point set with homothetic copies of several convex containers C1,...,Ck, while the objective is to minimize the maximum over the dilatat...
CCE
2008
13 years 8 months ago
2008
This paper presents a technique for simultaneous targeting and design in cooling water systems comprising of at least two cooling towers and several cooling water using operations...
CORR
2010
Springer
13 years 6 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...