A Branch-Price-and-Cut Procedure for the Discrete Ordered Median Problem - Archive ouverte HAL Access content directly
Journal Articles INFORMS Journal on Computing Year : 2021

A Branch-Price-and-Cut Procedure for the Discrete Ordered Median Problem

(1) , (2, 3) , (4) , (5)
1
2
3
4
5

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 small to large sized instances of DOMP in competitive computational time.
Fichier principal
Vignette du fichier
DOMPbcp.pdf (795.05 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01954865 , version 1 (14-12-2018)

Identifiers

Cite

Samuel Deleplanque, Martine Labbé, Diego Ponce Lopez, Justo Puerto. A Branch-Price-and-Cut Procedure for the Discrete Ordered Median Problem. INFORMS Journal on Computing, In press, ⟨10.1287/ijoc.2019.0915⟩. ⟨hal-01954865⟩
113 View
148 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More