Combining very large scale and ILP based neighborhoods for a two-level location problem
Effective heuristics for the two-level capacitated facility location problem. Design and experiment of very large scale neighborhoods using ILP based formulations and techniques. Reaching optimal solutions for a large set of instances. Tight approximations on instances whose size is out of reach for exact algorithms.
location local search variable neighborhood search very large scale neighborhood search matheuristics