Exact procedures for solving the discrete ordered median problem [An article from: Computers and Operations Research] | ![Exact procedures for solving the discrete ordered median problem [An article from: Computers and Operations Research]](http://ecx.images-amazon.com/images/I/41SS7GZHX6L._SL160_.jpg)
 enlarge | Authors: N. Boland, P. Dominguez-marin, S. Nickel, Puerto
Publisher: Elsevier
Category: Book
Buy New: $7.95
Format: Html
Media: Digital
Pages: 30
Publication Date: November 1, 2006
Availability: Available for download now
| |
| Editorial Reviews:
Product Description
This digital document is a journal article from Computers and Operations Research, published by Elsevier in 2006. The article is delivered in HTML format and is available in your Amazon.com Media Library immediately after purchase. You can view it with any web browser.
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.
|
|
|
