Exact procedures for solving the discrete ordered median problem

Title: Exact procedures for solving the discrete ordered median problem
Creator: Boland, Natashia; Domínguez-Marín, Patricia; Nickel, Stefan; Puerto, Justo
Relation: Computers & Operations Research Vol. 33, Issue 11, p. 3270-3300
Publisher Link: http://dx.doi.org/10.1016/j.cor.2005.03.025,
Publisher: Pergamon
Resource Type: journal article
Date: 2006
Description: The discrete ordered median problem (DOMP) integrates classical discrete location problems, such as the N-median, N-center and Uncapacitated Facility Location problems. It was introduced by Nickel (In: Fleischmann B, Lasch R, Derigs U, Domschke W, Rieder U, editors. Operations Research Proceedings 2000, Berlin: Springer, 2001. p. 71–76), 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.
Subject: discrete location; integer programming
Identifier: http://hdl.handle.net/1959.13/939389
Identifier: uon:12795
Identifier: ISSN:0305-0548
Language: eng
Reviewed

		Thumbnail	File	Description	Size	Format