A Branch-Price-and-Cut Procedure for the Discrete Ordered Median Problem - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Article Dans Une Revue INFORMS Journal on Computing Année : 2020

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

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.
Fichier principal
Vignette du fichier
DOMPbcp.pdf (795.05 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

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

Identifiants

Citer

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, 2020, ⟨10.1287/ijoc.2019.0915⟩. ⟨hal-01954865⟩
136 Consultations
171 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More