Formalising the Theory of Combinatorial Optimisation

Formalising the Theory of Combinatorial Optimisation

Explore the formalisation of combinatorial optimisation theory in this 35-minute lecture by Mohammad Abdulaziz from the Hausdorff Center for Mathematics. Delve into the process of formalising key results in Isabelle/HOL, with a particular focus on matching theory. Gain insights into polynomial-time computation, linear programming, flows, and matchings as central concepts in computer science, applied mathematics, and operational research. Discover mathematically interesting findings, examine various mathematical reasoning styles employed, and consider potential contributions of formalisations in this field. Learn about the collaborative nature of this work, which involves multiple authors.