Decomposition and local search based methods for the traveling umpire problem
We propose two complementary heuristic methods for the traveling umpire problem. We present a new lower bound methodology for the traveling umpire problem. The heuristic methods improve many best-known objective values known in literature. The lower bound methodology improves all best lower bounds known in literature.
decomposition traveling umpire problem heuristics or in sports iterated local search