A Branch-Price-and-Cut Procedure for the Discrete Ordered Median Problem
2020 ◽
Vol 32
(3)
◽
pp. 582-599
◽
Keyword(s):
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.
2019 ◽
Vol 8
(5)
◽
pp. 713-744
◽
Keyword(s):
1992 ◽
Vol 40
(1-supplement-1)
◽
pp. S40-S47
◽
2002 ◽
Vol 29
(10)
◽
pp. 1375-1391
◽
2010 ◽
Vol 8
(4)
◽
pp. 399
◽
2005 ◽
Vol 93
(4)
◽
pp. 173-175
◽
2014 ◽
Vol 52
(4)
◽
pp. 185-196
◽