On the exponential cardinality of FDS for the ordered p-median problem

Authors:
J. Puerto;A. M. RodríGuez-ChíA
Affiliations:
Dept. Estadistica e Investigacion Operativa, Facultad de Matemáticas, Universidad de Sevilla, 41012 Sevilla, Spain;Facultad de Ciencias, Universidad de Cádiz, Spain
Venue:
Operations Research Letters
Year:
2005

Citing 6
Cited 3

On ordered weighted averaging aggregation operators in multicriteria decisionmaking

IEEE Transactions on Systems, Man and Cybernetics
Finite dominating sets for network location problems

Operations Research
On the distribution approach to location problems

Computers and Industrial Engineering
Aggregation Error Bounds for a Class of Location Models

Operations Research
An O(pn2) algorithm for the p -median and related problems on tree graphs

Operations Research Letters
Algorithmic results for ordered median problems

Operations Research Letters

Convex ordered median problem with lp-norms

Computers and Operations Research
Finite dominating sets for the multi-facility ordered median problem in networks and algorithmic applications

Computers and Industrial Engineering
Unreliable point facility location problems on networks

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study finite dominating sets (FDS) for the ordered median problem. This kind of problems allows to deal simultaneously with a large number of models. We show that there is no valid polynomial size FDS for the general multifacility version of this problem even on path networks.