Sciweavers

282 search results - page 9 / 57
» Approximation algorithms for facility location problems
Sort
View
CORR
2010
Springer
122views Education» more  CORR 2010»
13 years 7 months ago
Facility Location with Client Latencies: Linear-Programming based Techniques for Minimum-Latency Problems
We introduce a problem that is a common generalization of the uncapacitated facility location (UFL) and minimum latency (ML) problems, where facilities not only need to be opened ...
Deeparnab Chakrabarty, Chaitanya Swamy
IPCO
2004
144views Optimization» more  IPCO 2004»
13 years 8 months ago
Hedging Uncertainty: Approximation Algorithms for Stochastic Optimization Problems
Abstract. We study two-stage, finite-scenario stochastic versions of several combinatorial optimization problems, and provide nearly tight approximation algorithms for them. Our pr...
R. Ravi, Amitabh Sinha
EOR
2002
67views more  EOR 2002»
13 years 7 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
STOC
2004
ACM
118views Algorithms» more  STOC 2004»
14 years 7 months ago
Boosted sampling: approximation algorithms for stochastic optimization
Several combinatorial optimization problems choose elements to minimize the total cost of constructing a feasible solution that satisfies requirements of clients. In the STEINER T...
Anupam Gupta, Martin Pál, R. Ravi, Amitabh ...
SODA
1998
ACM
86views Algorithms» more  SODA 1998»
13 years 8 months ago
Analysis of a Local Search Heuristic for Facility Location Problems
Madhukar R. Korupolu, C. Greg Plaxton, Rajmohan Ra...