Name
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. |
Year | DOI | Venue |
|---|---|---|
2002 | 10.1016/S0167-6377(02)00121-9 | Oper. Res. Lett. |
Keywords | Field | DocType |
new type,algorithms,finite dominating sets,objective function unifies,objective function,finite dominating set,complexity,common objective function,location theory,algorithmic result,detailed complexity analysis,polynomial time,recent series,median function,median problem,dominating set | Discrete mathematics,Mathematical optimization,Combinatorics,Location theory,Time complexity,Mathematics | Journal |
Volume | Issue | ISSN |
30 | 3 | Operations Research Letters |
Citations | PageRank | References |
42 | 2.48 | 16 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| JöRg Kalcsics | 1 | 170 | 23.42 |
| Stefan Nickel | 2 | 427 | 41.70 |
| Justo Puerto | 3 | 717 | 73.21 |
| Arie Tamir | 4 | 1201 | 137.91 |