An extended version of a Branch-Price-and-Cut Procedure for the Discrete Ordered Median Problem
Optimization and Control
2018-02-12 v1
Abstract
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.
Keywords
Cite
@article{arxiv.1802.03191,
title = {An extended version of a Branch-Price-and-Cut Procedure for the Discrete Ordered Median Problem},
author = {Samuel Deleplanque and Martine Labbé and Diego Ponce and Justo Puerto},
journal= {arXiv preprint arXiv:1802.03191},
year = {2018}
}