1. The Hungarian method for the assignment problem
2. and , “A Simple Algorithm for Finding Maximal Network Flows and an Application to the Hitchcock Problem,” RAND Corporation, Santa Monica, P-743, 26 September 1955.
3. The Traveling-Salesman Problem
4. “The Assignment Problem,” Proc. of Symposia in Applied Math., Vol. VI -Numerical Analysis, pp. 109–125, McGraw-Hill, New York, 1956.
5. An Algorithm for Distinct Representatives