Constraint relaxation for the discrete ordered median problem
Year of publication: |
2023
|
---|---|
Authors: | Martínez-Merino, Luisa I. ; Ponce, Diego ; Puerto, Justo |
Subject: | Branch-and-cut | Constraint relaxation | Discrete ordered median problem | Row generation | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Heuristik | Heuristics | Scheduling-Verfahren | Scheduling problem |
-
A revised Variable Neighborhood Search for the Discrete Ordered Median Problem
Olender, Paweł, (2019)
-
A new modeling approach for the unrestricted block relocation problem
Kimms, Alf, (2023)
-
A heuristic and an exact method for the gate matric connection cost minimization problem
De Giovanni, Luigi, (2013)
- More ...
-
A branch-and-price procedure for clustering data that are graph connected
Benati, Stefano, (2022)
-
Ponce, Diego, (2018)
-
A comparative study of formulations and solution methods for the discrete ordered p-median problem
Labbé, Martine, (2017)
- More ...