The ACO Seminar (2020–2021)

We consider some classical problems in Combinatorial Optimization when the weights/costs are random variables. We consider them from the point of view of their expected optimum value and from their algorithmic solvability. Our aim is to cover a lot of ground and to motivate the many open problems.

Please email Boris Bukh (bbukh ~at~ math) for a password.