TY - RPRT
A1 - Boland, N.
A1 - P., Dominguez-Marín
A1 - Nickel, S.
A1 - Puerto, J.
T1 - Exact Procedures for Solving the Discrete Ordered Median Problem
N2 - 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.
T3 - Berichte des Fraunhofer-Instituts für Techno- und Wirtschaftsmathematik (ITWM Report) - 47
KW - discrete location
KW - Integer programming
Y1 - 2003
UR - https://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/1504
UR - https://nbn-resolving.org/urn:nbn:de:hbz:386-kluedo-13126
ER -