Large Scale Optimization Problems II/III: Local Search with Large Neighborhoods

One approach for generating tight upper bounds for complex optimization problems is local search with large neighborhoods. We will explain the
approach and show recent results that were produced using this technique on the Travelling Salesman Problem (TSP).