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 ...
Abstract. Semidefinite relaxations are known to deliver good approximations for combinatorial optimization problems like graph bisection. Using the spectral bundle method it is pos...
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...
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...
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...