How can combinatorial optimization help in practice?
Báo cáo viên: Sigrid Knust (Osnabrueck University)

Thời gian: 9h, Thứ 4, Ngày 28/3/2018

Địa điểm: Phòng 301, Nhà A5, Viện Toán học

Tóm tắt: We consider two applications which have successfully been tackled with combinatorial optimization techniques.
The first one deals with shift scheduling of tank trucks for a small oil company. Given are a set of tank trucks with different characteristics and a set of drivers with different skills. The objective is to assign a feasible driver to every shift of the tank trucks such that several practical constraints are satisfied. We propose a two-phase solution algorithm which is based on a mixed integer linear programming formulation and an improvement procedure.
The second application is a sports scheduling problem for an odd number of teams where every team plays exactly two matches in each round and all matches have to be scheduled consecutively on a single court. By using graph theoretical approaches we construct schedules for any number of teams minimizing waiting times.