×
Hochbaum, Dorit S.

Heuristics for the fixed cost median problem. (English) Zbl 0473.90029

Math. Program. 22, 148-162 (1982).
Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page
scan of Zbl 0473.90029

Cited in 46 Documents

MSC:

90B05 Inventory, storage, reservoirs
90C35 Programming involving graphs or networks
65K05 Numerical mathematical programming methods

Keywords:

polynomial heuristics; discrete fixed cost median problem; plant location; continuous fixed cost median problem; network fixed cost median problem; convex costs; set covering; worst case analysis; continuous location
Cite Review PDF
Full Text: DOI

References:

[1] V. Chvátal, ”A greedy heuristic for the set-covering problem”,Mathematics of Operations Research 4 (3) (1979) 233–235. · Zbl 0443.90066 · doi:10.1287/moor.4.3.233
[2] G. Cornuejols, M.L. Fisher and G. Nemhauser, ”Location of bank accounts to optimize float”,Management Science 23 (8) (1977) 789–810. · Zbl 0361.90034 · doi:10.1287/mnsc.23.8.789
[3] S.L. Hakimi, ”Optimum distribution of switching centers in a communication network and some related graph theoretic problems”,Operations Research 13 (1965) 462–475. · Zbl 0135.20501 · doi:10.1287/opre.13.3.462
[4] D.S. Johnson, ”Approximation algorithms for combinatorial problems”,Journal of Computer and Systems Sciences 9 (1974) 256–278. · Zbl 0296.65036 · doi:10.1016/S0022-0000(74)80044-9
[5] U.G. Knight,Power systems engineering and mathematics (Pergamon Press, London 1972). · Zbl 0259.54020
[6] L. Lovasz, ”On the ratio of optimal integral and fractional covers”,Discrete Mathematics 13 (1975) 383–390. · Zbl 0323.05127 · doi:10.1016/0012-365X(75)90058-8
[7] ”1970 National Power Survey”, Part 1, Prepared by the Federal Power Commission, U.S. Government Printing Office.
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.