| Autor: |
Deleplanque, Samuel, Labbé, Martine, Ponce, Diego, Puerto, Justo |
| Rok vydání: |
2018 |
| Předmět: |
|
| Druh dokumentu: |
Working Paper |
| Popis: |
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 to optimality small to moderate size of DOMP in competitive computational time. |
| Databáze: |
arXiv |
| Externí odkaz: |
|
