Artículo
A Branch-Price-and-Cut Procedure for the Discrete Ordered Median Problem
Autor/es | Deleplanque, Samuel
Labbé, Martine Ponce López, Diego Puerto Albandoz, Justo |
Departamento | Universidad de Sevilla. Departamento de Estadística e Investigación Operativa |
Fecha de publicación | 2020-01-07 |
Fecha de depósito | 2022-11-03 |
Publicado en |
|
Resumen | 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 ... 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. |
Cita | Deleplanque, S., Labbé, M., Ponce López, D. y Puerto Albandoz, J. (2020). A Branch-Price-and-Cut Procedure for the Discrete Ordered Median Problem. INFORMS journal on computing, 32 (3), 582-599. https://doi.org/10.1287/ijoc.2019.0915. |
Ficheros | Tamaño | Formato | Ver | Descripción |
---|---|---|---|---|
A Branch-Price-and-Cut Procedure ... | 1.074Mb | [PDF] | Ver/ | |