OPAL — Optimization and Algorithms

This is a hybrid conference, with free-of-charge registration for all participants, for online & in-person attendance as well.

The conference will focus on the study of discrete mathematical models; e.g. graphs (networks) and hypergraphs, the algorithmic complexity of combinatorial problems, approximability in discrete optimization, but will also include other areas of discrete mathematics, including discrete geometry. During the conference we will celebrate the past 25 years of Semi Online problems. The conference is also dedicated to celebrate the 70-th birthday of Zsolt Tuza.