Row relaxation for the DOMP

Resumen

The Discrete Ordered Median Problem (DOMP) seeks for the location p facilities and the allocation of each client to its closest open facility in sucha way that the ordered weighted average of the allocation costs is minimized. In recent years, DOMP has been formulated using set packing constraints known as strong order constraints or SOC. In this work, we explore a solution method based on the relaxation of SOC. This procedure starts with a relaxed formulation where all SOC are removed and feasibility is enforced adding model constraints from SOC family in thesearching tree. Besides, we compare the performance of this row relaxation approach using callbacks based on specific tailor made oracles with respect to the use of fixed pools of contraints defined in advance. Futhermore, we compare this procedure with other previous solution methods for the DOMP.