A shortest augmenting path method for solving minimal perfect matching problems

This publication has 13 references indexed in Scilit:

• A generalized Hungarian method for solving minimum weight perfect matching problems with algebraic objective
  Discrete Applied Mathematics, 1979
• A primal algorithm for optimum matching
  Published by Springer Nature ,1978
• The alternating basis algorithm for assignment problems
  Mathematical Programming, 1977
• An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on Graphs
  Journal of the ACM, 1976
• Shortest alternating path algorithms
  Networks, 1974
• Facets of I-matching polyhedra
  Lecture Notes in Mathematics, 1974
• Matching, Euler tours and the Chinese postman
  Mathematical Programming, 1973
• Maximum matching and a polyhedron with 0,1-vertices
  Journal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1965
• Paths, Trees, and Flowers
  Canadian Journal of Mathematics, 1965
• The Hungarian method for the assignment problem
  Naval Research Logistics Quarterly, 1955