Combinatorial Optimization

  • Jesús De Loera

    University of California at Davis, USA
  • Satoru Iwata

    University of Tokyo, Japan
  • Martin Skutella

    Technische Universität Berlin, Germany
Combinatorial Optimization cover
Download PDF

A subscription is required to access this article.


Combinatorial Optimization is an active research area that developed from the rich interaction among many mathematical areas, including combinatorics, graph theory, geometry, optimization, probability, theoretical computer science, and many others. It combines algorithmic and complexity analysis with a mature mathematical foundation and it yields both basic research and applications in manifold areas such as, for example, communications, economics, traffic, network design, VLSI, scheduling, production, computational biology, to name just a few. Through strong inner ties to other mathematical fields it has been contributing to and benefiting from areas such as, for example, discrete and convex geometry, convex and nonlinear optimization, algebraic and topological methods, geometry of numbers, matroids and combinatorics, and mathematical programming. Moreover, with respect to applications and algorithmic complexity, Combinatorial Optimization is an essential link between mathematics, computer science and modern applications in data science, economics, and industry.

Cite this article

Jesús De Loera, Satoru Iwata, Martin Skutella, Combinatorial Optimization. Oberwolfach Rep. 15 (2018), no. 4, pp. 2969–3023

DOI 10.4171/OWR/2018/50