Title of article :
Exact procedures for solving the discrete ordered median problem
Author/Authors :
Natashia Boland، نويسنده , , Patricia Dom?nguez-Mar?n، نويسنده , , Stefan Nickel، نويسنده , , Justo Puerto، نويسنده ,
Issue Information :
ماهنامه با شماره پیاپی سال 2006
Abstract :
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.
Keywords :
Discrete location , Integer programming
Journal title :
Computers and Operations Research
Journal title :
Computers and Operations Research