Hi Daniel, For the matching problem there are some heuristics for finding cutting planes without using flow-networks methods. Disabling dual-reductions works incredible. Thank you very much.
I'm implementing the Grötschel-Holland algorithm for solving the matching problem using linear programming. The key of this algorithm is that its use a few restriction of the matching polyhedron an...