Sciweavers

282 search results - page 17 / 57
» Approximation algorithms for facility location problems
Sort
View
COR
2011
14 years 5 months ago
MIP models for connected facility location: A theoretical and computational study
This article comprises the first theoretical and computational study on mixed integer programming (MIP) models for the connected facility location problem (ConFL). ConFL combines...
Stefan Gollowitzer, Ivana Ljubic
PPSN
1998
Springer
15 years 2 months ago
Integrated Facility Design Using an Evolutionary Approach with a Subordinate Network Algorithm
The facility design problem is a common one in manufacturing and service industries and has been studied extensively in the literature. However, restrictions on the scope of the de...
Bryan A. Norman, Alice E. Smith, Rifat Aykut Arapo...
ICALP
2010
Springer
15 years 2 months ago
Network Design via Core Detouring for Problems without a Core
Some of the currently best-known approximation algorithms for network design are based on random sampling. One of the key steps of such algorithms is connecting a set of source nod...
Fabrizio Grandoni, Thomas Rothvoß
MOR
2010
118views more  MOR 2010»
14 years 8 months ago
Strategyproof Approximation of the Minimax on Networks
We consider the problem of locating a facility on a network, represented by a graph. A set of strategic agents have different ideal locations for the facility; the cost of an age...
Noga Alon, Michal Feldman, Ariel D. Procaccia, Mos...