Data for: A comparison of separation routines for Benders optimality cuts for two-level facility location problems

This compressed file contains the source code, data, and complete achieved results for the paper "A comparison of separation routines for Benders optimality cuts for two-level facility location problems". Note that CPLEX was used as our solver

Data for: A comparison of separation routines for Benders optimality cuts for two-level facility location problems

This compressed file contains the source code, data, and complete achieved results for the paper "A comparison of separation routines for Benders optimality cuts for two-level facility location problems". Note that CPLEX was used as our solver.THIS DATASET IS ARCHIVED AT DANS/EASY, BUT NOT ACCESSIBLE HERE. TO VIEW A LIST OF FILES AND ACCESS THE FILES IN THIS DATASET CLICK ON THE DOI-LINK ABOV

A comparison of separation routines for benders optimality cuts for two-level facility location problems.

This paper studies two-level uncapacitated facility location problems, a class of discrete location problems that consider different hierarchies of facilities and their interactions. Benders reformulations for both single and multiple assignment variants and while several separation procedures for three classes of Benders cuts are presented: standard optimality cuts, lifted optimality cuts, and non-dominated optimality cuts. Extensive computational experiments are performed on difficult and large-scale benchmark instances to assess the performance of the considered separation routines