A generalized Hungarian method for solving minimum weight perfect matching problems with algebraic objective
- 30 November 1979
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 1 (3) , 167-180
- https://doi.org/10.1016/0166-218x(79)90041-6
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- An algebraic approach to assignment problemsMathematical Programming, 1977
- An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on GraphsJournal of the ACM, 1976
- Note—A Model for Minimizing the Cost of Drilling Dual Completion Oil WellsManagement Science, 1973
- Matching, Euler tours and the Chinese postmanMathematical Programming, 1973
- Maximum matching and a polyhedron with 0,1-verticesJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1965
- Paths, Trees, and FlowersCanadian Journal of Mathematics, 1965