Loading...
Please wait, while we are loading the content...
Similar Documents
Improved approximation of the general soft-capacitated facility location problem (2007).
| Content Provider | CiteSeerX |
|---|---|
| Author | Alfandari, Laurent |
| Abstract | The Soft-Capacitated Facility Location Problem, where each facility is composed of a variable number of fixed-capacity production units, has been recently studied in several papers, especially in the metric case. In this paper, we only consider the general problem where connection costs do not systematically satisfy the triangle inequality property. We show that an adaptation of the set covering greedy heuristic, where the subproblem is approximately solved by a Fully Polynomial-Time Approximation Scheme based on cost scaling and dynamic programming, achieves a logaritmic approximation ratio of (1 + ɛ)H(n) for the problem, where n is the number of customers to be served and H is the harmonic series. This improves the previous bound of 2H(n) for this problem. Key-words: facility location, set covering, dynamic programming, FPTAS. 1 |
| File Format | |
| Publisher Date | 2007-01-01 |
| Access Restriction | Open |
| Subject Keyword | General Soft-capacitated Facility Location Problem Dynamic Programming Connection Cost Fixed-capacity Production Unit Metric Case Logaritmic Approximation Ratio Cost Scaling Triangle Inequality Property Several Paper Greedy Heuristic Previous Bound Variable Number Harmonic Series Fully Polynomial-time Approximation Scheme Facility Location General Problem Soft-capacitated Facility Location Problem |
| Content Type | Text |
