Reinelt and D.O. Theis, Odd minimum cut sets and b-matchings revisited, SIAM Journal of Discrete Mathematics 22 (2008) 1480-1487.A. N. Letchford, G. Reinelt, and D. O. Theis. Odd Minimum Cut Sets and b-Matchings Revisited. SIAM J. Discret. Math., 22(4):1480-1487, Oct. 2008...
The famous Padberg-Rao separation algorithm for b-matching polyhedra can be implemented to run in O(n^2m log(n^2/m)) time in the uncapacitated case, and in O(nm^2 log(n^2/m)) time in the capacitated case (where n is the number of vertices and m is the nu