par Labbé, Martine 
;Ponce Lopez, Diego ;Puerto Albandoz, Justo
Référence Computers & operations research, 78, page (230-242)
Publication Publié, 2017-02
;Ponce Lopez, Diego ;Puerto Albandoz, JustoRéférence Computers & operations research, 78, page (230-242)
Publication Publié, 2017-02
Article révisé par les pairs
| Résumé : | This paper presents several new formulations for the Discrete Ordered Median Problem (DOMP) based on its similarity with some scheduling problems. Some of the new formulations present a considerably smaller number of constraints to define the problem with respect to some previously known formulations. Furthermore, the lower bounds provided by their linear relaxations improve the ones obtained with previous formulations in the literature even when strengthening is not applied. We also present a polyhedral study of the assignment polytope of our tightest formulation showing its proximity to the convex hull of the integer solutions of the problem. Several resolution approaches, among which we mention a branch and cut algorithm, are compared. Extensive computational results on two families of instances, namely randomly generated and from Beasley's OR-library, show the power of our methods for solving DOMP. |
