Now showing items 11-15 of 15
A novel optimization algorithm for video placement and routing
(Institute of Electrical and Electronics Engineers, 2006)
In this paper, we propose a novel optimization algorithm for the solution of the video placement and routing problem based on Lagrangean relaxation and decomposition. The main contribution can be stated as the use of integer ...
An exact algorithm for the capacitated vertex p-center problem
We develop a simple and practical exact algorithm for the problem of locating p facilities and assigning clients to them within capacity restrictions in order to minimize the maximum distance between a client and the ...
A strong conic quadratic reformulation for machine-job assignment with controllable processing times
We describe a polynomial-size conic quadratic reformulation for a machine-job assignment problem with separable convex cost. Because the conic strengthening is based only on the objective of the problem, it can also be ...
The single-assignment hub covering problem: models and linearizations
(Palgrave Macmillan Ltd., 2003)
We study the hub covering problem which, so far, has remained one of the unstudied hub location problems in the literature. We give a combinatorial and a new integer programming formulation of the hub covering problem ...
Designing a road network for hazardous materials shipments
We consider the problem of designating hazardous materials routes in and through a major population center. Initially, we restrict our attention to a minimally connected network (a tree) where we can predict accurately the ...