Sciweavers

282 search results - page 12 / 57
» Approximation algorithms for facility location problems
Sort
View
MP
1998
105views more  MP 1998»
13 years 10 months ago
Capacitated facility location: Separation algorithms and computational experience
We consider the polyhedral approach to solving the capacitated facility location problem. The valid inequalities considered are the knapsack, ow cover, e ective capacity, single d...
Karen Aardal
DCOSS
2005
Springer
14 years 4 months ago
A Local Facility Location Algorithm for Sensor Networks
In this paper we address a well-known facility location problem (FLP) in a sensor network environment. The problem deals with finding the optimal way to provide service to a (poss...
Denis Krivitski, Assaf Schuster, Ran Wolff
SAGA
2005
Springer
14 years 4 months ago
Dynamic Facility Location with Stochastic Demands
Abstract. In this paper, a Stochastic Dynamic Facility Location Problem (SDFLP) is formulated. In the first part, an exact solution method based on stochastic dynamic programming ...
Martin Romauch, Richard F. Hartl
GRID
2007
Springer
13 years 10 months ago
A Local Facility Location Algorithm for Large-scale Distributed Systems
In the facility location problem (FLP) we are given a set of facilities and a set of clients, each of which is to be served by one facility. The goal is to decide which subset of f...
Denis Krivitski, Assaf Schuster, Ran Wolff
HEURISTICS
1998
103views more  HEURISTICS 1998»
13 years 10 months ago
Computing Approximate Solutions of the Maximum Covering Problem with GRASP
We consider the maximum covering problem, a combinatorial optimization problem that arises in many facility location problems. In this problem, a potential facility site covers a s...
Mauricio G. C. Resende