Irodalomjegyzék

[1] Egerváry Jenő. Mátrixok kombinatorikus tulajdonságairól. Matematikai és Fizikai Lapok. 38. 1931. 16–28.

[2] Egerváry Jenő. On Combinatorial Properties of Matrices, translated by H. W. Kuhn. Logistics Papers (Issue 11), Paper 4, George Washington University. 4/11. 1955. 1–11.

[3] Euler L.. Solutio problematis ad geometriam situs pertinentis. Commentarii Academiae Scientiarum Imperialis Petropolitanae. 8. 1736. 128–140.

[4] Ford L. R., Jr.. Network Flow Theory. The RAND Corporation, Paper-923, July 14. 1956.

[5] Ford L. R., Jr.-Fulkerson D. R.. Flow in Networks. Princeton University Press, Princeton, N. J.. 1962.

[6] History of Mathematical Programming, A Collection of Personal Reminiscences. Stichting Mathematisch Centrum. 1991. 77–81.

[7] Hitchock F. L.. Distribution of a Product from Several Sources to Numerous Localities. J. Math. Phys.. 20. 1941.

[8] Klafszky Emil. Hálózati folyamok. Bolyai János Matematikai Társulat kiadványa, Budapest. 1969.

[9] Kőnig Dénes. Theorie der endlichen und unendlichen Graphen: kombinatorische Topologie der Strechenkomplexe. Akademische Verlagsgesellschaft, Leipzig. 1936.

[10] Kuhn H. W.. The Hungarian Method for the Assignment Problem. Naval Research Logistics Quarterly. 2. 1955. 83–97.

[11] Minty G. J.. A Comment on the Sortest Route Problem. Operations Research. 5. 1957.