Combinatorial optimization searches for an optimal object in a nite collection; typically the collection has a concise representation while the number of objects is huge. Polyhedral and linear programming techniques have proved to be very powerful and successful in tackling various combinatorial optimization problems, and the end products of these methods are often integral polyhedra or min-max relations. This area of combinatorial optimization is called polyhedral combinatorics. In this talk I shall give a brief survey of our recent results on polyhedral combinatorics, including a tournament ranking with no errors, a polyhedral description of kernels, and a characterization of the box-totally dual integral (box-TDI) matching polytope.

Organizers: Society of Graph Theory and Combinatorics, ORSC ; Center of Graph Theory, Combinatorics & Network of AMSS ; Yuncheng University

Plenary talk