Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
Cutset Formulation: MST Problem
This lecture covers the cutset formulation for the Minimum Spanning Tree (MST) Problem, exploring decision variables, constraints, and the quality of the formulation. It delves into the subtour elimination formulation, discussing its strength and complexity. The instructor explains the Gomory Cutting Planes method, detailing the idea, algorithm, and examples. The lecture concludes with LP-based Branch & Bound, illustrating the algorithm and its application through an example.
This video is available exclusively on Mediaspace for a restricted audience. Please log in to MediaSpace to access it if you have the necessary permissions.
Watch on Mediaspace