The fortenth edition of the Polyhedra and Combinatorial Optimization Days (JPOC14) will be held in Caen on June 12 and 13, 2025.

Combinatorial optimization is a branch of discrete mathematics related to graph theory, mathematical programming, theoretical computer science (algorithmics and complexity theory) and operations research. Its importance is justified by the numerous practical applications that are formulated as combinatorial optimization problems and by the high difficulty of the optimization problems it addresses.

Polyhedral approaches are one of the powerful tools of this discipline. Initiated in 1965 by Jack Edmonds during his study of matching in a graph, they are used to solve difficult combinatorial optimization problems. These techniques, sometimes coupled with other methods such as column generation, allow the development of efficient algorithms. This field continues to develop on the theoretical level as well as on the application level, both for designing approximation algorithms and for solving difficult problems of large size.

The main objective of the JPOC conferences is to promote, in France, polyhedral techniques and combinatorial optimization in general by creating links between teams working on this theme and on related topics such as optimization, combinatorics and graph theory.

A summer school, to be held on June 10 and 11, 2025, will precede the conference, and will be supervised by leading researchers specialized in a chosen topic. These courses can be used to validate ECTS points of doctoral schools intended for the training PhD students.