Algorithms for combinatorial optimization

点击翻译按钮获取中文摘要

The aim of this project is to find efficient algorithms for combinatorial optimization problems. These problems arise in both theoretical and applied settings. The most famous problem of this type is the Travelling Salesman Problem, but many combinatorial optimization problems are linked through beautiful theory and common ideas. Combinatorial optimization problems are characterized by having a discrete search space. The challenge is that this space is nevertheless too large to enumerate completely, even with very fast computers, so intelligent algorithms and heuristics are required. Our aim is to find and analyze such algorithms.