We consider the traveling tournament problem, which is a well-known benchmark problem in tournament timetabling. It consists of designing a schedule for a sports league of n teams such that the total traveling costs of the teams are minimized. The most important variant of the traveling...

In this thesis, we consider several problems related to online resource management. In online optimization, an algorithm has to make decisions based on a sequence of incoming bits of information without knowledge of future inputs. We apply the well-established concept of competitive analysis in...