Branch-and-Price and Improved Bounds to the Traveling Umpire Problem

Abstract

The present paper proposes a branch-and-price approach to the Traveling Umpire Problem (TUP). In this hard combinatorial optimization problem, umpires (or referees) have to be assigned to games in a double round robin tournament. The objective is to obtain a solution with minimum total travel distance over all umpires, while respecting several hard… (More)

Topics

5 Figures and Tables

Cite this paper

@inproceedings{Toffolo2014BranchandPriceAI, title={Branch-and-Price and Improved Bounds to the Traveling Umpire Problem}, author={T{\'u}lio A. M. Toffolo and Sam Van Malderen and Tony Wauters and Greet Vanden Berghe}, year={2014} }