Discrete optimization brings together techniques from various disciplines to tackle optimization problems over discrete or combinatorial structures. The core problems in discrete optimization (often motivated by applications) span the whole complexity spectrum, and therefore lead to a rich array of concepts and tools. Important recent and ongoing developments in the field include graph-theoretic characterizations, convex programming based relaxations and hierarchies, approximability and its limits, algebraic approaches, online optimization, and computational advances.
This workshop will bring together experts on the different facets of discrete optimization with the goal of further improving the cross-fertilization of ideas and techniques. Topics will include combinatorial algorithms and characterizations, polyhedral combinatorics and integer programming, graph theory, matroids and other fundamental combinatorial structures, and nonlinear approaches and problems.
Sanjeev Arora
(Princeton University)
Gérard Cornuéjols
(Carnegie-Mellon University)
Jesús De Loera
(University of California, Davis (UC Davis))
Friedrich Eisenbrand
(École Polytechnique Fédérale de Lausanne (EPFL))
Michel Goemans, Chair
(Massachusetts Institute of Technology)
Matthias Koeppe
(University of California, Davis (UC Davis))
Copyright. All Rights Reserved.