Mathematical Programming

, Volume 22, Issue 1, pp 148–162

Heuristics for the fixed cost median problem

  • Dorit S. Hochbaum

DOI: 10.1007/BF01581035

Cite this article as:
Hochbaum, D.S. Mathematical Programming (1982) 22: 148. doi:10.1007/BF01581035


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.

Key words

Set Covering ProblemMedian ProblemLocation ProblemsHeuristicsWorst Case AnalysisContinuous Location Problem

Copyright information

© The Mathematical Programming Society, Inc. 1982

Authors and Affiliations

  • Dorit S. Hochbaum
    • 1
  1. 1.Graduate School of Industrial AdministrationCarnegie-Mellon UniversityPittsburghUSA