Management Science · 1967 · 282 citations · 6 references
Natural SciencesIndustrial EngineeringAlgorithmsOptimizationTransportationAssignment ProblemsCombinatorial OptimizationConvex OptimizationCost MinimizationOptimization TheoryTransportation ProblemsConvex Feasibility ProblemsFeasible FlowMinimal FlowsMinimum Cost FlowMinimum-cost Flow AlgorithmsMinimum-cost Flow ProblemNetwork Flow ProblemsPrimal-dual Algorithms
A simple procedure is given for solving minimal cost flow problems in which feasible flows are maintained throughout. It specializes to give primal algorithms for the assignment and transportation problems. Convex cost problems can also be handled.
6
The Hungarian method for the assignment problem
Harold W. Kuhn · Naval Research Logistics Quarterly · 1955 · 12.6K citations
A Decomposition Algorithm for Shortest Paths in a Network
T. C. Hu · Operations Research · 1968 · 69 citations