Cunningham, W. H.; Marsh, A. B. III A primal algorithm for optimum matching. (English) Zbl 0409.90081 Polyhedral combinatorics, dedic. to the Mem. of D. R. Fulkerson, Math. Program. Study 8, 50-72 (1978). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 5 ReviewsCited in 39 Documents MSC: 90C35 Programming involving graphs or networks 90C10 Integer programming 68R10 Graph theory (including graph drawing) in computer science 68Q25 Analysis of algorithms and problem complexity 65K05 Numerical mathematical programming methods 05C35 Extremal problems in graph theory Keywords:Optium Matching; Primal Algorithm; Polyhedral Combinatorics; Integer Programming; Post-Optimality; Graph Theory; Blossom Algorithm; Computational Complexity; Linear Programming Duality; Matching Polyhedron; Computational Experience; Total Dual Integrality; Optimum B- Matching Citations:Zbl 0398.00003; Zbl 0398.90064 PDF BibTeX XML OpenURL