1. R. K. Ahuja, T. L. Magnanti, and J. B. Orlin (1993), Network Flows: Theory, Algorithms and Applications. Prentice Hall.
2. M. Akgul . (1990), A Forest Primal-dual Algorithm for the Assignment Problem. Bilkent University, Ankara, Turkey, Research Report: IEOR-9014, 0 (0): 1–2.
3. F. Avram and D. J. Bertsimas (1993), On a Characterization of the Minimum Assignment and Matching in the Independent Random Model. In The third Symposium in Integer Programming and Combinatorial Optimization, Enrice, Italy.
4. M. L. Balinski (1985), “Signature Methods for the Assignment Problem,” Operations Research 33 (3) 527–536.
5. D. P. Bertsekas (1990), “The Auction Algorithm for Assignment and other Network Flow Problems: A tutorial,” Interfaces 20 (4) 133–149.