Author:
Korte Bernhard,Vygen Jens
Publisher
Springer Berlin Heidelberg
Reference24 articles.
1. Anstee, R.P.: A polynomial algorithm for
Anstee, R.P.
$b$
-matchings: an alternative approach. Information Processing Letters 24, 153–157 (1987)
2. Babenko, M.A. und Karzanov, A.V.: Minimum mean cycle problem in bidirected and skew-symmetric graphs. Discrete Optimization
Babenko, M.A.
Karzanov, A.V.
6, 92–97 (2009)
3. Barahona, F.: Reducing matching to polynomial size linear programming. SIAM Journal on Optimization
Barahona, F.
3, 688–695 (1993)
4. Caprara, A., Fischetti, M.:
Caprara, A.
Fischetti, M.
$\{ 0,\frac{1}{2}\}$
-Chvátal-Gomory cuts. Mathematical Programming
Chvátal, V.
Gomory, R.E.
74, 221–235 (1996)
5. Edmonds, J.: Maximum matching and a polyhedron with (0,1) vertices. Journal of Research of the National Bureau of Standards B
Edmonds, J.
69, 125–130 (1965)