Algorithmic results for ordered median problems

Jörg Kalcsics, Stefan Nickel, Justo Puerto, Arie Tamir*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

Abstract

In a recent series of papers a new type of objective function in location theory, called ordered median function, has been introduced and analyzed. This objective function unifies and generalizes most common objective functions used in location theory. In this paper we identify finite dominating sets for these models and develop polynomial time algorithms together with a detailed complexity analysis.

Original languageEnglish
Pages (from-to)149-158
Number of pages10
JournalOperations Research Letters
Volume30
Issue number3
DOIs
Publication statusPublished - Jun 2002

Keywords

  • Algorithms
  • Complexity
  • Finite dominating sets
  • Location theory

Fingerprint

Dive into the research topics of 'Algorithmic results for ordered median problems'. Together they form a unique fingerprint.

Cite this