Speaker:
Jingyang Zhao(University of Electronic and Science Technology of China)
Time:
- 10:00-12:00 (Time in Beijing)
- 14:00-16:00 (Time in Auckland)
- September 10, 2021 (Friday)
VooVmeeting:
Link: https://meeting.tencent.com/dm/xKZlIrcZhk0Z
ID: 704 420 285
Venue:
Qingshuihe Campus
Abstract:
The Traveling Tournament Problem is a complex combinatorial optimization problem in tournament timetabling, which asks us to design a double round-robin under several feasibility requirements such that the total distance traveled by all the n teams (n is even) is minimized. In this talk, I will focus on the problem where at most three consecutive home games or away games are allowed (TTP-3) and I will introduce some results on approximation algorithms.