L. I. Martínez-Merino, D. Ponce, J. Puerto
Recently, the Discrete Ordered Median Problem (DOMP) has been formulated using set packing constraints to model the order. These constraints are also known as Strong Order Constraints (SOC). We propose a branch-and-cut procedure starting from a constraints relaxation of the DOMP. Particularly, we consider a constraints relaxation of the DOMP where SOC are not included and we add them iteratively using row generation techniques to certify feasibility and optimality. We present some computational results that compare this procedure with other formulations and solution techniques for the DOMP.
Palabras clave: Discrete Ordered Median Problem, Branch-and-Cut, Constraints relaxation, MILP.
Programado
GT01 Localización IV. Discrete Location
8 de junio de 2022 16:00
A15
