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...
| Authors: | ; ; ; |
|---|---|
| Format: | Article |
| Status: | Published version |
| Publication date: | 2020 |
| Country: | España |
| Institution: | Universidad de Sevilla (US) |
| Repository: | idUS. Depósito de Investigación de la Universidad de Sevilla |
| OAI Identifier: | oai:idus.us.es:11441/138653 |
| Online Access: | https://hdl.handle.net/11441/138653 https://doi.org/10.1287/ijoc.2019.0915 |
| Access Level: | Open access |
| Keyword: | discrete optimization location theory branch and price ordered median problems |
| _version_ | 1878739035988426752 |
|---|---|
| author | Deleplanque, Samuel |
| author2 | Labbé, Martine Ponce López, Diego Puerto Albandoz, Justo |
| author2_role | author author author |
| author_browse | Deleplanque, Samuel Labbé, Martine Ponce López, Diego Puerto Albandoz, Justo |
| author_facet | Deleplanque, Samuel Labbé, Martine Ponce López, Diego Puerto Albandoz, Justo |
| author_role | author |
| collection | idUS. Depósito de Investigación de la Universidad de Sevilla |
| 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. |
| eu_rights_str_mv | openAccess |
| format | article |
| id | ES_b9e1a2db5b3a12e875ce192e4eabb611 |
| institution | Universidad de Sevilla (US) |
| instname_str | Universidad de Sevilla (US) |
| network_acronym_str | ES |
| network_name_str | España |
| oai_identifier_str | oai:idus.us.es:11441/138653 |
| publishDate | 2020 |
| publishDateSort | 2020 |
| publisher | informs |
| publisherStr | informs |
| reponame_str | idUS. Depósito de Investigación de la Universidad de Sevilla |
| spelling | A Branch-Price-and-Cut Procedure for the Discrete Ordered Median Problem Deleplanque, Samuel Labbé, Martine Ponce López, Diego Puerto Albandoz, Justo discrete optimization location theory branch and price ordered median problems 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. informs https://hdl.handle.net/11441/138653 https://doi.org/10.1287/ijoc.2019.0915 |
| 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 |
| status_str | publishedVersion |
| title | 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_short | 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 |
| topic | discrete optimization location theory branch and price ordered median problems |
| topic_facet | discrete optimization location theory branch and price ordered median problems |
| url | https://hdl.handle.net/11441/138653 https://doi.org/10.1287/ijoc.2019.0915 |