Linear Programming 11: Maximum weight matching
Abstract: We describe how the maximum weight matching problem can be setup as an integer linear programming problem. This is an easy integer program, in the sense that the relaxed linear program obtains the same optimal value.
This video accompanies the class "Linear Programming and Network Flows" at Colorado State University
https://www.math.colostate.edu/~adams/teaching/math510fall2020/
We are following the book "Understanding and Using Linear Programming" by Jiří Matoušek and Bernd Gärtner
https://link.springer.com/book/10.1007/978-3-540-30717-4
Our course notes are available at
https://www.math.colostate.edu/~adams/teaching/math510fall2020/LinearProgrammingNotes.pdf
