par Deleplanque, Samuel ;Labbé, Martine ;Ponce, Diego;Puerto, Justo
Référence INFORMS journal on computing, 32, 3, page (582-599)
Publication Publié, 2020-03-01
Article révisé par les pairs
Résumé : 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.