Robust MILP formulations for the two-stage weighted vertex p-center problem

Cristian Duran-Mateluna, Zacharie Alès, Sourour Elloumi, Natalia Jorquera-Bravo

Abstract: Highlights•Five MILP formulations considering box uncertainty sets on demands and distances•The optimal solution can be obtained by only considering a finite subset of scenarios•A branch-and-cut algorithm and a column-and-constraint algorithm are proposed•The exact solution algorithms can be adapted to solve the single-stage problem