Formalising Theory of Combinatorial Optimisation

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

• Mohammad Abdulaziz (King's College London)
• Thursday 25 April 2024, 17:00-18:00
• Live-streamed at MR14 Centre for Mathematical Sciences.

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

Online

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 : https://www.microsoft.com/en-gb/microsoft-teams/join-a-meeting?rtc=1 Meeting ID: 370 771 279 261 Passcode: iCo7a5

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

This talk is included in these lists:

• All CMS events
• All Talks (aka the CURE list)
• CMS Events
• Cambridge talks
• DPMMS Lists
• DPMMS Pure Maths study groups
• DPMMS info aggregator
• DPMMS lists
• Department of Computer Science and Technology talks and seminars
• Formalisation of mathematics with interactive theorem provers
• Hanchen DaDaDash
• Interested Talks
• Live-streamed at MR14 Centre for Mathematical Sciences
• School of Physical Sciences
• School of Technology
• Trust & Technology Initiative - interesting events
• bld31

Note that ex-directory lists are not shown.