University of Cambridge > > Formalisation of mathematics with interactive theorem provers  > Formalising Theory of Combinatorial Optimisation

Formalising Theory of Combinatorial Optimisation

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Anand Rao Tadipatri.


Combinatorial optimisation is a central area in computer science, applied mathematics, and operational research. Ideas and notions developed within the area of combinatorial optimisation include linear programming, flows, and matchings. In this talk I will describe the formalisation, in Isabelle/HOL, of some results from the theory of combinatorial optimisation, mainly focusing on the theory of matching. I will briefly discuss mathematically interesting findings and also formalisation/methodological findings.


WATCH ONLINE HERE : Meeting ID: 370 771 279 261 Passcode: iCo7a5

This talk is part of the Formalisation of mathematics with interactive theorem provers series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2024, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity