Recent progress and interesting facts about the Simplex Algorithm

The POC group (Polyhèdres et Optimization Combinatoire) is a group transversal to various French research laboratories (LAMSADE, LIMOS, LIPN, ESSEC, etc.) which welcomes academics but also colleagues from companies (such as Orange and EDF) brought together by the interest towards the polyhedral (both theoretical and algorithmic) aspects of combinatorial optimization problems. The group organizes two seminars per year (SPOC) on topics complementary to the group's themes, as well as JPOC (https://jpoc13.sciencesconf.org) and ISCO (https://www.lamsade.dauphine.fr/~isco). The topic of this edition of SPOC is "Recent progress and interesting facts about the Simplex Algorithm" and it will include the talks of some distinguished experts in the field such as: Xavier Allamigeon (INRIA / CMAP, École Polytechnique, France) Daniel Dadush (CWI Institute, Netherlands) Sophie Huiberts (CNRS / LIMOS, France) Quentin Louveaux (Institut Montefiore, Université de Liège, Belgium) Even after more than 50 years, the Simplex algorithm is a topic of great interest and discovery. Our speakers will share their insights, recent findings, and perspectives on this algorithm.