Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
10523999 | Operations Research Letters | 2005 | 11 Pages |
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
J. Puerto, A.M. RodrÃguez-ChÃa,