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...

ver descrição completa

Detalhes bibliográficos
Autores: Boland, Natashia, Domínguez Marín, Patricia, Nickel, Stefan, Puerto Albandoz, Justo
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
id ES_ad92f17c852fd552a16ec6037a8e59a3
oai_identifier_str oai:idus.us.es:11441/47455
network_acronym_str ES
network_name_str España
repository_id_str
spelling Exact procedures for solving the discrete ordered median problemBoland, NatashiaDomínguez Marín, PatriciaNickel, StefanPuerto Albandoz, JustoDiscrete locationInteger programmingThe 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.Ministerio de Ciencia y TecnologíaElsevierEstadística e Investigación OperativaFQM331: Metodos y Modelos de la Estadistica y la Investigacion OperativaMinisterio de Ciencia y Tecnología (MCYT). España2006info:eu-repo/semantics/articleinfo:eu-repo/semantics/submittedVersionapplication/pdfapplication/pdfhttp://hdl.handle.net/11441/47455https://doi.org/10.1016/j.cor.2005.03.025reponame:idUS. Depósito de Investigación de la Universidad de Sevillainstname:Universidad de Sevilla (US)InglésComputers and Operations Research, 33 (11), 3270-3300.BFM01-2378HA2003:0121MTM04-0909http://ac.els-cdn.com/S0305054805001206/1-s2.0-S0305054805001206-main.pdf?_tid=0c26af7a-9139-11e6-8dde-00000aacb35f&acdnat=1476358668_898577e84e1ececc4f67e3b8f6c8125finfo:eu-repo/semantics/openAccessoai:idus.us.es:11441/474552026-06-17T12:51:07Z
dc.title.none.fl_str_mv Exact procedures for solving the discrete ordered median problem
title Exact procedures for solving the discrete ordered median problem
spellingShingle Exact procedures for solving the discrete ordered median problem
Boland, Natashia
Discrete location
Integer programming
title_short Exact procedures for solving the discrete ordered median problem
title_full Exact procedures for solving the discrete ordered median problem
title_fullStr Exact procedures for solving the discrete ordered median problem
title_full_unstemmed Exact procedures for solving the discrete ordered median problem
title_sort Exact procedures for solving the discrete ordered median problem
dc.creator.none.fl_str_mv Boland, Natashia
Domínguez Marín, Patricia
Nickel, Stefan
Puerto Albandoz, Justo
author Boland, Natashia
author_facet Boland, Natashia
Domínguez Marín, Patricia
Nickel, Stefan
Puerto Albandoz, Justo
author_role author
author2 Domínguez Marín, Patricia
Nickel, Stefan
Puerto Albandoz, Justo
author2_role author
author
author
dc.contributor.none.fl_str_mv Estadística e Investigación Operativa
FQM331: Metodos y Modelos de la Estadistica y la Investigacion Operativa
Ministerio de Ciencia y Tecnología (MCYT). España
dc.subject.none.fl_str_mv Discrete location
Integer programming
topic Discrete location
Integer programming
description 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.
publishDate 2006
dc.date.none.fl_str_mv 2006
dc.type.none.fl_str_mv info:eu-repo/semantics/article
info:eu-repo/semantics/submittedVersion
format article
status_str submittedVersion
dc.identifier.none.fl_str_mv http://hdl.handle.net/11441/47455
https://doi.org/10.1016/j.cor.2005.03.025
url http://hdl.handle.net/11441/47455
https://doi.org/10.1016/j.cor.2005.03.025
dc.language.none.fl_str_mv Inglés
language_invalid_str_mv Inglés
dc.relation.none.fl_str_mv Computers and Operations Research, 33 (11), 3270-3300.
BFM01-2378
HA2003:0121
MTM04-0909
http://ac.els-cdn.com/S0305054805001206/1-s2.0-S0305054805001206-main.pdf?_tid=0c26af7a-9139-11e6-8dde-00000aacb35f&acdnat=1476358668_898577e84e1ececc4f67e3b8f6c8125f
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
application/pdf
dc.publisher.none.fl_str_mv Elsevier
publisher.none.fl_str_mv Elsevier
dc.source.none.fl_str_mv reponame:idUS. Depósito de Investigación de la Universidad de Sevilla
instname:Universidad de Sevilla (US)
instname_str Universidad de Sevilla (US)
reponame_str idUS. Depósito de Investigación de la Universidad de Sevilla
collection idUS. Depósito de Investigación de la Universidad de Sevilla
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869416469858615296
score 15,301603

Registos relacionados