Theis, Odd minimum cut sets and b-matchings revisited, SIAM Journal of Discrete Mathematics 22 (2008) 1480-1487.Adam N. Letchford, Gerhard Reinelt, e Dirk O. Theis. Odd minimum cut-sets and b- matchings revisited. SIAM Journal on Discrete Mathematics, 22(4), 2008....
Odd minimum cut sets and b-matchings revisited 来自 Semantic Scholar 喜欢 0 阅读量: 50 作者: ADAM N. LETCHFORD,GERHARD REINELT,DIRK OLIVER THEIS 摘要: 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 ...
Comput OR 34:817–834 Padberg MW, Rao MR (1982) Odd minimum cut-sets and b-matchings. Math Oper Res 7:67–80 Pepin A-S, Desaulniers G, Hertz A, Huisman D (2009) Comparison of Heuristic approaches for the multiple depot vehicle scheduling problem. J Sched 12:17–30 Pulleyblank WR,...