Sciweavers

667 search results - page 11 / 134
» Approximation algorithms for connected facility location pro...
Sort
View
90
Voted
SPAA
2010
ACM
15 years 3 months ago
Parallel approximation algorithms for facility-location problems
This paper presents the design and analysis of parallel approximation algorithms for facility-location problems, including NC and RNC algorithms for (metric) facility location, k-...
Guy E. Blelloch, Kanat Tangwongsan
EOR
2002
67views more  EOR 2002»
14 years 10 months ago
Solving the multiple competitive facilities location problem
In this paper we propose five heuristic procedures for the solution of the multiple competitive facilities location problem. A franchise of several facilities is to be located in ...
Tammy Drezner, Zvi Drezner, Said Salhi
99
Voted
ESA
2008
Springer
115views Algorithms» more  ESA 2008»
14 years 12 months ago
Deterministic Sampling Algorithms for Network Design
For several NP-hard network design problems, the best known approximation algorithms are remarkably simple randomized algorithms called Sample-Augment algorithms in [11]. The algor...
Anke van Zuylen
SODA
1998
ACM
86views Algorithms» more  SODA 1998»
14 years 11 months ago
Analysis of a Local Search Heuristic for Facility Location Problems
Madhukar R. Korupolu, C. Greg Plaxton, Rajmohan Ra...
ISMIS
2009
Springer
15 years 4 months ago
GIS-FLSolution: A Spatial Analysis Platform for Static and Transportation Facility Location Allocation Problem
Static and transportation facility location allocation problem is a new problem in facility location research. It aims to find out optimal locations of static and transportation fa...
Wei Gu, Xin Wang, Liqiang Geng