Workshop in 2026
We are happy to announce that the 15th edition of the workshop will take place on September 21-25, 2026 at the Institut d'Études Scientifiques de Cargèse (IESC). This year's workshop is devoted to "Matroid Theory". The website for the workshop is linked below:
About
The yearly Cargese workshop aims to bring together researchers in combinatorial optimization around a chosen topic of current interest. It is intended to be a forum for the exchange of recent developments and powerful tools, with an emphasis on theory. Other goals include the promotion of interactions between participants and discussions of open problems.
The current organization commitee consists of Ahmad Abdi, Daniel Dadush, Yuri Faenza, Samuel Fiorini, Britta Peis, Laura Sanità, Paolo Ventura, and Stefan Weltge. They receive advise from the steering commitee, consisting of Fritz Eisenbrand, Michel Goemans, Monique Laurent, R. Ravi, and Jens Vygen.
Previous editions
- 2025: Fast Algorithms for Linear Programming and their Combinatorial Applications
- 2024: Sampling and Counting
- 2023: Machine Learning and Discrete Optimization (held in Porquerolles)
- 2022: Polyhedral Combinatorics
The first ten editions have been organized by Samuel Fiorini, Gianpaolo Oriolo, Gautier Stauffer, and Paolo Ventura. They received advise from the steering commitee, consisting of Fritz Eisenbrand, Michel Goemans, Monique Laurent, and R. Ravi.
- 2019: Proofs from the Book in Combinatorial Optimization
- 2018: Algorithms from Structure, Structure from Algorithms
- 2017: Computational Combinatorial Optimization (held in Porquerolles)
- 2016: Discrete Geometry and Algorithms for Integer Programming
- 2015: Fast Algorithms
- 2014: Extended Formulations II
- 2013: Submodular Functions
- 2012: The Traveling Salesman Problem
- 2011: Rounding in Combinatorial Optimization
- 2010: Extended Formulations I