Review of recent developments: Location problems

  • Authors:
  • P.M Dearing

  • Affiliations:
  • Department of Mathematical Sciences, Clemson University, Clemson, SC 29634-1907, USA

  • Venue:
  • Operations Research Letters
  • Year:
  • 1985

Quantified Score

Hi-index 0.00

Visualization

Abstract

Recent developments for several location problems are surveyed. These include: graph theoretic and combinatorial formulations of the simple plant location problem, the NP-hardness of some p-center problems, worst-case bounds for several polynomial-time heuristics for some p-center problems, and a general solution to a class of one facility network problems with convex cost functions.