A Branch-Price-and-Cut Procedure for the Discrete Ordered Median Problem

The discrete ordered median problem (DOMP) is formulated as a set-partitioning problem using an exponential number of variables. Each variable corresponds to a set of demand points allocated to the same facility with the information of the sorting position of their corresponding costs. We develop a...

Descripción completa

Detalles Bibliográficos
Autores: Deleplanque, Samuel, Labbé, Martine, Ponce López, Diego, Puerto Albandoz, Justo
Tipo de recurso: artículo
Estado:Versión publicada
Fecha de publicación:2020
País:España
Institución:Universidad de Sevilla (US)
Repositorio:idUS. Depósito de Investigación de la Universidad de Sevilla
OAI Identifier:oai:idus.us.es:11441/138653
Acceso en línea:https://hdl.handle.net/11441/138653
https://doi.org/10.1287/ijoc.2019.0915
Access Level:acceso abierto
Palabra clave:discrete optimization
location theory
branch and price
ordered median problems
id ES_b9e1a2db5b3a12e875ce192e4eabb611
oai_identifier_str oai:idus.us.es:11441/138653
network_acronym_str ES
network_name_str España
repository_id_str
spelling A Branch-Price-and-Cut Procedure for the Discrete Ordered Median ProblemDeleplanque, SamuelLabbé, MartinePonce López, DiegoPuerto Albandoz, Justodiscrete optimizationlocation theorybranch and priceordered median problemsThe discrete ordered median problem (DOMP) is formulated as a set-partitioning problem using an exponential number of variables. Each variable corresponds to a set of demand points allocated to the same facility with the information of the sorting position of their corresponding costs. We develop a column generation approach to solve the continuous relaxation of this model. Then we apply a branch-price-and-cut algorithm to solve small- to large-sized instances of DOMP in competitive computational time.informsEstadística e Investigación OperativaFQM331: Metodos y Modelos de la Estadistica y la Investigacion Operativa2020info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionapplication/pdfapplication/pdfhttps://hdl.handle.net/11441/138653https://doi.org/10.1287/ijoc.2019.0915reponame:idUS. Depósito de Investigación de la Universidad de Sevillainstname:Universidad de Sevilla (US)InglésINFORMS journal on computing, 32 (3), 582-599.https://doi.org/10.1287/ijoc.2019.0915info:eu-repo/semantics/openAccessoai:idus.us.es:11441/1386532026-06-17T12:51:07Z
dc.title.none.fl_str_mv A Branch-Price-and-Cut Procedure for the Discrete Ordered Median Problem
title A Branch-Price-and-Cut Procedure for the Discrete Ordered Median Problem
spellingShingle A Branch-Price-and-Cut Procedure for the Discrete Ordered Median Problem
Deleplanque, Samuel
discrete optimization
location theory
branch and price
ordered median problems
title_short A Branch-Price-and-Cut Procedure for the Discrete Ordered Median Problem
title_full A Branch-Price-and-Cut Procedure for the Discrete Ordered Median Problem
title_fullStr A Branch-Price-and-Cut Procedure for the Discrete Ordered Median Problem
title_full_unstemmed A Branch-Price-and-Cut Procedure for the Discrete Ordered Median Problem
title_sort A Branch-Price-and-Cut Procedure for the Discrete Ordered Median Problem
dc.creator.none.fl_str_mv Deleplanque, Samuel
Labbé, Martine
Ponce López, Diego
Puerto Albandoz, Justo
author Deleplanque, Samuel
author_facet Deleplanque, Samuel
Labbé, Martine
Ponce López, Diego
Puerto Albandoz, Justo
author_role author
author2 Labbé, Martine
Ponce López, Diego
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
dc.subject.none.fl_str_mv discrete optimization
location theory
branch and price
ordered median problems
topic discrete optimization
location theory
branch and price
ordered median problems
description The discrete ordered median problem (DOMP) is formulated as a set-partitioning problem using an exponential number of variables. Each variable corresponds to a set of demand points allocated to the same facility with the information of the sorting position of their corresponding costs. We develop a column generation approach to solve the continuous relaxation of this model. Then we apply a branch-price-and-cut algorithm to solve small- to large-sized instances of DOMP in competitive computational time.
publishDate 2020
dc.date.none.fl_str_mv 2020
dc.type.none.fl_str_mv info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
format article
status_str publishedVersion
dc.identifier.none.fl_str_mv https://hdl.handle.net/11441/138653
https://doi.org/10.1287/ijoc.2019.0915
url https://hdl.handle.net/11441/138653
https://doi.org/10.1287/ijoc.2019.0915
dc.language.none.fl_str_mv Inglés
language_invalid_str_mv Inglés
dc.relation.none.fl_str_mv INFORMS journal on computing, 32 (3), 582-599.
https://doi.org/10.1287/ijoc.2019.0915
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 informs
publisher.none.fl_str_mv informs
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_ 1869417810625560576
score 15,300724

Similares en LA Referencia