Heuristics for the fixed cost median problem
- Dorit S. Hochbaum
- … show all 1 hide
Purchase on Springer.com
$39.95 / €34.95 / £29.95*
Rent the article at a discountRent now
* Final gross prices may vary according to local VAT.
We describe in this paper polynomial heuristics for three important hard problems—the discrete fixed cost median problem (the plant location problem), the continuous fixed cost median problem in a Euclidean space, and the network fixed cost median problem with convex costs. The heuristics for all the three problems guarantee error ratios no worse than the logarithm of the number of customer points. The derivation of the heuristics is based on the presentation of all types of median problems discussed as a set covering problem.
- V. Chvátal, “A greedy heuristic for the set-covering problem”,Mathematics of Operations Research 4 (3) (1979) 233–235.
- G. Cornuejols, M.L. Fisher and G. Nemhauser, “Location of bank accounts to optimize float”,Management Science 23 (8) (1977) 789–810.
- S.L. Hakimi, “Optimum distribution of switching centers in a communication network and some related graph theoretic problems”,Operations Research 13 (1965) 462–475.
- D.S. Johnson, “Approximation algorithms for combinatorial problems”,Journal of Computer and Systems Sciences 9 (1974) 256–278.
- U.G. Knight,Power systems engineering and mathematics (Pergamon Press, London 1972).
- L. Lovasz, “On the ratio of optimal integral and fractional covers”,Discrete Mathematics 13 (1975) 383–390.
- “1970 National Power Survey”, Part 1, Prepared by the Federal Power Commission, U.S. Government Printing Office.
- Heuristics for the fixed cost median problem
Volume 22, Issue 1 , pp 148-162
- Cover Date
- Print ISSN
- Online ISSN
- Additional Links
- Set Covering Problem
- Median Problem
- Location Problems
- Worst Case Analysis
- Continuous Location Problem
- Industry Sectors
- Author Affiliations
- 1. Graduate School of Industrial Administration, Carnegie-Mellon University, 15213, Pittsburgh, PA, USA