Improved complexity bounds for location problems on the real line

Research output: Contribution to journalArticlepeer-review

Abstract

In this note we apply recent results in dynamic programming to improve the complexity bounds of several median and coverage location models on the real line.

Original languageEnglish
Pages (from-to)395-402
Number of pages8
JournalOperations Research Letters
Volume10
Issue number7
DOIs
StatePublished - Oct 1991

Keywords

  • center problems
  • computational complexity
  • facility location
  • median problems

Fingerprint

Dive into the research topics of 'Improved complexity bounds for location problems on the real line'. Together they form a unique fingerprint.

Cite this