Combinatorial Optimization

  • Karen I. Aardal

    Delft University of Technology, Netherlands
  • Satoru Iwata

    University of Tokyo, Japan
  • Volker Kaibel

    Otto-von-Guericke-Universität, Magdeburg, Germany
  • Ola Nils A. Svensson

    EPFL IC IINFCOM THL2, Lausanne, Switzerland


Combinatorial Optimization deals with optimization problems defined on combinatorial structures such as graphs and networks. Motivated by diverse practical problem setups, the topic has developed into a rich mathematical discipline with many connections to other fields of Mathematics (such as, e.g., Combinatorics, Convex Optimization and Geometry, and Real Algebraic Geometry). It also has strong ties to Theoretical Computer Science and Operations Research. A series of Oberwolfach Workshops have been crucial for establishing and developing the field. The workshop we report about was a particularly exciting event—due to the depth of results that were presented, the spectrum of developments that became apparent from the talks, the breadth of the connections to other mathematical fields that were explored, and last but not least because for many of the particiants it was the first opportunity to exchange ideas and to collaborate during an on-site workshop since almost two years.

Cite this article

Karen I. Aardal, Satoru Iwata, Volker Kaibel, Ola Nils A. Svensson, Combinatorial Optimization. Oberwolfach Rep. 18 (2021), no. 4, pp. 2893–2954

DOI 10.4171/OWR/2021/53