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

Authors:
Huajun Tang;T. C. E. Cheng;C. T. Ng
Affiliations:
Department of Logistics and Maritime Studies, The Hong Kong Polytechnic University Hung Hom, Kowloon, Hong Kong SAR, China;Department of Logistics and Maritime Studies, The Hong Kong Polytechnic University Hung Hom, Kowloon, Hong Kong SAR, China;Department of Logistics and Maritime Studies, The Hong Kong Polytechnic University Hung Hom, Kowloon, Hong Kong SAR, China
Venue:
Computers and Industrial Engineering
Year:
2009

Citing 4
Cited 0

Finite dominating sets for network location problems

Operations Research
An Approach to Location Models Involving Sets as Existing Facilities

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

Operations Research Letters
Algorithmic results for ordered median problems

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

We identify a finite dominating set (FDS) for a special case of the multi-facility ordered median problem in networks, in which the @l-weights can take at least two different values. This FDS result not only includes the FDS research for the p-center problem, but also extends the case of a