A shortest augmenting path algorithm for dense and sparse linear assignment problems

References

Page 1

	Year	Citations
A note on two problems in connexion with graphs E. Dijkstra Numerische Mathematik Mathematical ProgrammingGraph MinorEngineeringGraph TheoryExtremal Graph Theory	1959	23.5K
The Hungarian method for the assignment problem Harold W. Kuhn Naval Research Logistics Quarterly Mathematical ProgrammingEngineeringNumerical ScoresHungarian MathematiciansInteger Optimization	1955	12.2K
Combinatorial Optimization: Algorithms and Complexity. David Johnson, Christos H. Papadimitriou, Kenneth Steiglitz American Mathematical Monthly Mathematical ProgrammingEngineeringAlgorithm DesignLocal Search HeuristicsCombinatory Analysis	1984	6K
Combinatorial optimization:Algorithms and complexity L. R. Rabiner IEEE Transactions on Acoustics Speech and Signal Processing EngineeringCombinatorial ProblemComputational ComplexityComputer ScienceDiscrete Mathematics	1984	3.6K
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems Jack Edmonds, Richard M. Karp Journal of the ACM Network Flow ProblemsTheoretical ImprovementsEngineeringAnalysis Of AlgorithmNetwork Analysis	1972	2.5K
A new algorithm for the assignment problem Dimitri P. Bertsekas Mathematical Programming Mathematical ProgrammingEngineeringAlgorithm DesignCombinatorial ProblemComputational Complexity	1981	288
Improving the Hungarian assignment algorithm Roy Jonker, Ton Volgenant Operations Research Letters Mathematical ProgrammingArtificial IntelligenceEngineeringData MiningCombinatorial Problem	1986	272
On some techniques useful for solution of transportation network problems Nobuaki Tomizawa Networks Mathematical ProgrammingOriginal NetworkTransport Network AnalysisN‐by‐n Assignment ProblemEngineering	1971	248
The alternating basis algorithm for assignment problems R. S. Barr, Fred Glover, Darwin Klingman Mathematical Programming Mathematical ProgrammingEngineeringAlgorithm DesignCombinatorial ProblemComputational Complexity	1977	154
Signature Methods for the Assignment Problem Michel Balinski Operations Research Mathematical ProgrammingComputational Complexity TheoryEngineeringSignature MethodsComputational Complexity	1985	128

Page 1