Large Scale Optimization Problems I/III: Approaches for Large Scale Optimization Problems

(for example the Traveling Salesman Problem or the Steiner
tree problem) recent developments made it possible
to find the exact solution of problem instances with ten thousand
vertices and more.
We give an overview on some approaches for large problems
(e.g., preprocessing techniques, fast upper and lower bound
computation, partitioning).
We will demonstrate the impact of these techniques on the Steiner tree
problem in networks.