We consider the complexity of the traveling tournament problem, which is a well-known benchmark problem in tournament timetabling. The problem was supposed to be computationally hard ever since itsâ€¦ (More)

In this paper we propose an approximation for the Traveling Tournament Problem which is the problem of designing a schedule for a sports league consisting of a set of teams T such that the totalâ€¦ (More)

In this talk we investigate a real-world large scale vehicle routing problem posed by our cooperation partner, the German Automobile Association (ADAC). Service vunits are requested to assist peopleâ€¦ (More)

We consider the online problem k-CTP, which is the problem to guide a vehicle from some site s to some site t on a road map given by a graph G = (V,E) in which up to k (unknown) edges are blocked byâ€¦ (More)

In a k-server routing problem k â‰¥ 1 servers move in a metric space in order to visit specified points or carry objects from sources to destinations. In the online version requests arrive online whileâ€¦ (More)

Column generation techniques have become a widely used technique to successfully solve large (integer) linear programs. One of the keys to obtaining a practically efficient algorithm is to have aâ€¦ (More)

The traveling tournament problem is a well-known combinatorial optimization problem with application to sport leagues scheduling, that sparked intensive algorithmic research over the last decade.â€¦ (More)