Formalising the Theory of Combinatorial Optimisation
Offered By: Hausdorff Center for Mathematics via YouTube
Course Description
Overview
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.
Syllabus
Mohammad Abdulaziz: Formalising the Theory of Combinatorial Optimisation
Taught by
Hausdorff Center for Mathematics
Related Courses
Linear and Discrete OptimizationÉcole Polytechnique Fédérale de Lausanne via Coursera Linear and Integer Programming
University of Colorado Boulder via Coursera Graph Partitioning and Expanders
Stanford University via NovoEd Discrete Inference and Learning in Artificial Vision
École Centrale Paris via Coursera Convex Optimization
Stanford University via edX