A primal algorithm for optimum matching
Data up to Jan 2025
Total Citations Per Year
Abstract
References (19)
The Hungarian method for the assignment problem
1955 • 11,128 citations
Lecture Notes in Mathematics
2007 • 10,414 citations
Paths, Trees, and Flowers
1965 • 2,165 citations
Maximum matching and a polyhedron with 0,1-vertices
1965 • 1,719 citations
Paths, Trees, and Flowers
2009 • 1,627 citations
Matching, Euler tours and the Chinese postman
1973 • 979 citations
Distinct representatives of subsets
1948 • 229 citations
Matching, a well solved class of integer linear programs
1970 • 216 citations
A network simplex method
1976 • 207 citations
The alternating basis algorithm for assignment problems
1977 • 158 citations
Combinatorial Optimization
2013 • 148 citations
Facets of I-matching polyhedra
1974 • 143 citations
A Primal Method for the Assignment and Transportation Problems
1964 • 123 citations
On the structure of factorizable graphs
1972 • 111 citations
Mathematical centre amsterdam
1953 • 53 citations
Establishing the matching polytope
1972 • 43 citations
Local Unimodularity in the Matching Polytope
1978 • 24 citations
On the 1-factors of n-connected graphs
1971 • 17 citations
A proof of total dual integrality of matching polyhedra
1977 • 11 citations