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

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

0.00 Avg rating0 Votes
Article ID: iaor2006733
Country: Netherlands
Volume: 33
Issue: 6
Start Page Number: 641
End Page Number: 651
Publication Date: Nov 2005
Journal: Operations Research Letters
Authors: ,
Keywords: sets
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.

Reviews

Required fields are marked *. Your email address will not be published.