Skip to content

Algorithms for the Assignment and Transportation Problems

Authors: James Munkres

Published: 1957 (Journal Paper)

Source: Journal of the Society for Industrial and Applied Mathematics

Algorithm: Munkres algorithm

DOI: 10.1137/0105003

Summary

Revisits the Hungarian method for the assignment problem and proves that it runs in polynomial time, giving the algorithm its modern form. Also extends the approach to the transportation problem.

Abstract

Primary

Paper epubs.siam.org

Standard

DOI 10.1137/0105003

Alternate

jstor.org jstor.org

Tags

  • Assignment problem

  • Hungarian algorithm

  • Transportation problem

  • Combinatorial optimization

  • Polynomial time algorithm