Algorithmic results for ordered median problems

Jörg Kalcsics; Stefan Nickel; Justo Puerto; Arie Tamir

doi:10.1016/S0167-6377(02)00121-9

Algorithmic results for ordered median problems

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

^*Corresponding author for this work

School of Mathematics

Research output: Contribution to journal › Article › peer-review

Abstract / Description of output

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 language	English
Pages (from-to)	149-158
Number of pages	10
Journal	Operations Research Letters
Volume	30
Issue number	3
DOIs	https://doi.org/10.1016/S0167-6377(02)00121-9
Publication status	Published - Jun 2002

Keywords / Materials (for Non-textual outputs)

Algorithms
Complexity
Finite dominating sets
Location theory

Access to Document

10.1016/S0167-6377(02)00121-9

Cite this

@article{c2ee8e118d7046679fdee1a858d68c9a,

title = "Algorithmic results for ordered median problems",

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.",

keywords = "Algorithms, Complexity, Finite dominating sets, Location theory",

author = "J{\"o}rg Kalcsics and Stefan Nickel and Justo Puerto and Arie Tamir",

year = "2002",

month = jun,

doi = "10.1016/S0167-6377(02)00121-9",

language = "English",

volume = "30",

pages = "149--158",

journal = "Operations Research Letters",

issn = "0167-6377",

publisher = "Elsevier",

number = "3",

}

TY - JOUR

T1 - Algorithmic results for ordered median problems

AU - Kalcsics, Jörg

AU - Nickel, Stefan

AU - Puerto, Justo

AU - Tamir, Arie

PY - 2002/6

Y1 - 2002/6

N2 - 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.

AB - 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.

KW - Algorithms

KW - Complexity

KW - Finite dominating sets

KW - Location theory

UR - http://www.scopus.com/inward/record.url?scp=0036600858&partnerID=8YFLogxK

U2 - 10.1016/S0167-6377(02)00121-9

DO - 10.1016/S0167-6377(02)00121-9

M3 - Article

AN - SCOPUS:0036600858

SN - 0167-6377

VL - 30

SP - 149

EP - 158

JO - Operations Research Letters

JF - Operations Research Letters

IS - 3

ER -

Algorithmic results for ordered median problems

Abstract / Description of output

Keywords / Materials (for Non-textual outputs)

Access to Document

Other files and links

Fingerprint

Cite this