Management Science · 1964 · 121 citations · 6 references
BusinessIndustrial EngineeringAlgorithmsOptimizationTransportationAssignment ProblemsCombinatorial OptimizationInteger ProgrammingLinear ProgrammingTransportation ProblemsHungarian AlgorithmLower Bounds
This paper describes a simple calculation for the assignment and transportation problems which is “dual to” the well-known Hungarian Method. While the Hungarian is a dual method, this method is primal and so gives a feasible assignment at each stage of the calculation. Bounds on the number of steps required for the assignment and transportation problems are given. They are the same as the best bounds known for the Hungarian Method.
6
The Hungarian method for the assignment problem
Harold W. Kuhn · Naval Research Logistics Quarterly · 1955 · 12.6K citations