The facility location problem with general cost functions
- 3 June 2003
- Vol. 42 (1), 42-47
- https://doi.org/10.1002/net.10080
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Improved Approximation Algorithms for Metric Facility Location ProblemsLecture Notes in Computer Science, 2002
- An Improved Approximation Algorithm for the Metric Uncapacitated Facility Location ProblemLecture Notes in Computer Science, 2002
- A Greedy Facility Location Algorithm Analyzed Using Dual FittingLecture Notes in Computer Science, 2001
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxationJournal of the ACM, 2001
- Analysis of a Local Search Heuristic for Facility Location ProblemsJournal of Algorithms, 2000
- Improved Approximation Algorithms for Capacitated Facility Location ProblemsLecture Notes in Computer Science, 1999
- Greedy Strikes Back: Improved Facility Location AlgorithmsJournal of Algorithms, 1999
- Improved Approximation Algorithms for Uncapacitated Facility LocationLecture Notes in Computer Science, 1998
- An improved approximation ratio for the minimum latency problemMathematical Programming, 1998
- New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalitiesIEEE Transactions on Information Theory, 1977