Exact Procedures for Solving the Discrete Ordered Median Problem

• The Discrete Ordered Median Problem (DOMP) generalizes classical discrete location problems, such as the N-median, N-center and Uncapacitated Facility Location problems. It was introduced by Nickel [16], who formulated it as both a nonlinear and a linear integer program. We propose an alternative integer linear programming formulation for the DOMP, discuss relationships between both integer linear programming formulations, and show how properties of optimal solutions can be used to strengthen these formulations. Moreover, we present a specific branch and bound procedure to solve the DOMP more efficiently. We test the integer linear programming formulations and this branch and bound method computationally on randomly generated test problems.

Author: N. Boland, Dominguez-Marín P., S. Nickel, J. Puerto urn:nbn:de:hbz:386-kluedo-13126 Berichte des Fraunhofer-Instituts für Techno- und Wirtschaftsmathematik (ITWM Report) (47) Report English 2003 2003 Fraunhofer-Institut für Techno- und Wirtschaftsmathematik 2004/02/10 Integer programming; discrete location Fraunhofer (ITWM) 5 Naturwissenschaften und Mathematik / 51 Mathematik / 510 Mathematik Standard gemäß KLUEDO-Leitlinien vor dem 27.05.2011

$Rev: 13581$