Algorithms for the Assignment and Transiortation Troblems*

@inproceedings{Munkres1957AlgorithmsFT,
  title={Algorithms for the Assignment and Transiortation Troblems*},
  author={James Munkres},
  year={1957}
}
  • James Munkres
  • Published 1957
In this paper we presen algorithms for the solution of the general assignment and transportation problems. In Section 1, a statement of the algorithm for the assignment problem appears, along with a proof for the correctness of the algorithm. The remarks which constitute the proof are incorporated parenthetically into the statement of the algorithm. Following this appears a discussion of certain theoretical aspects of the problem. In Section 2, the algorithm is generalized to one for the… CONTINUE READING
Highly Influential
This paper has highly influenced 101 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 2,301 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 1,288 extracted citations

2,301 Citations

0100200'71'87'04
Citations per Year
Semantic Scholar estimates that this publication has 2,301 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.

FuLKERSON, A simple algorithm for finding maximal network flows and an application to the Hitchcock problem

  • L P Ford, Jr And D R
  • FuLKERSON, A simple algorithm for finding maximal…
  • 1955

Similar Papers

Loading similar papers…