1. Bertsekas D. P.(1979), “A Distributed Algorithm for the Assignment Problems,” Laboratory for Information and Decision Systems Working Paper, M.I.T., Cambridge
2. Bertsekas D. P.(1986), “Distributed Relaxation Methods for Linear Network Flow Problems,” Proceedings of 25th IEEE Conference on Decision and Control, Athens, Greece, pp. 2101–2106
3. Bertsekas D. P.(1986), “Distributed Asynchronous Relaxation Methods for Linear Network Flow Problems,” Laboratory for Information and Decision Systems Report P-1606, M.I.T., Cambridge
4. Bertsekas D. P.(1991), Linear Network Optimization: Algorithms and Codes, M.I.T. Press, Cambridge
5. Bertsekas D. P.(1992), “An Auction/Sequential Shortest Path Algorithm for the Min Cost Flow Problem,” Laboratory for Information and Decision Systems Report P-2146, M.I.T., Cambridge