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.

Export metadata

  • Export Bibtex
  • Export RIS

Additional Services

Share in Twitter Search Google Scholar
Metadaten
Author:N. Boland, Dominguez-Marín P., S. Nickel, J. Puerto
URN (permanent link):urn:nbn:de:hbz:386-kluedo-13126
Serie (Series number):Berichte des Fraunhofer-Instituts für Techno- und Wirtschaftsmathematik (ITWM Report) (47)
Document Type:Report
Language of publication:English
Year of Completion:2003
Year of Publication:2003
Publishing Institute:Fraunhofer-Institut für Techno- und Wirtschaftsmathematik
Tag:Integer programming; discrete location
Faculties / Organisational entities:Fraunhofer (ITWM)
DDC-Cassification:510 Mathematik

$Rev: 12793 $