-
1
-
2
Revisiting a Cutting-Plane Method for Perfect Matchings
Published 2020-12-01“…In 2016, Chandrasekaran, Végh, and Vempala (Mathematics of Operations Research, 41(1):23–48) published a method to solve the minimum-cost perfect matching problem on an arbitrary graph by solving a strictly polynomial number of linear programs. …”
Get full text
Article