52 search results - page 1 / 11 » Supporting the Search for the Optimal Location of Facilities |
WSCG
2001
13 years 8 months ago
2001
the problem of locating services in a given context requires a methematical abstraction so that its complexity can be managed by means of an iterative search through context simul...
IPCO
2010
13 years 5 months ago
2010
We consider the facility location problem where each facility can serve at most U clients. We analyze a local search algorithm for this problem which uses only the operations of ad...
STOC
2005
ACM
14 years 7 months ago
2005
ACM
In combinatorial optimization, a popular approach to NP-hard problems is the design of approximation algorithms. These algorithms typically run in polynomial time and are guarante...
HM
2007
Springer
14 years 1 months ago
2007
Springer
The connected facility location (ConFL) problem generalizes the facility location problem and the Steiner tree problem in graphs. Given a graph G = (V, E), a set of customers D ⊆...
CP
2009
Springer
14 years 8 months ago
2009
Springer
Abstract. We address a location-allocation problem that requires deciding the location of a set of facilities, the allocation of customers to those facilities under facility capaci...