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 [S. Nickel. Discrete Ordered Weber problems. In B. Fleischmann, R. Lasch, U. Derigs, W. Domschke, and...
| Autores: | , , , |
|---|---|
| Formato: | artículo |
| Estado: | Versión enviada para evaluación y publicación |
| Fecha de publicación: | 2006 |
| País: | España |
| Recursos: | Universidad de Sevilla (US) |
| Repositorio: | idUS. Depósito de Investigación de la Universidad de Sevilla |
| OAI Identifier: | oai:idus.us.es:11441/47455 |
| Acesso em linha: | http://hdl.handle.net/11441/47455 https://doi.org/10.1016/j.cor.2005.03.025 |
| Access Level: | acceso abierto |
| Palavra-chave: | Discrete location Integer programming |
| Resumo: | 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 [S. Nickel. Discrete Ordered Weber problems. In B. Fleischmann, R. Lasch, U. Derigs, W. Domschke, and U. Rieder, editors, Operations Research Proceedings 2000, pages 71–76. Springer, 2001], 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. |
|---|