1. O.N. Bondareva, “Some applications of linear programming methods to the theory of cooperative games,”Problemy Kibernetiki 10 (1963) 119–129. [In Russian.]
2. D. Granot and G. Huberman, “Minimum cost spanning tree games,”Mathematical Programming 21 (1981) 1–18.
3. P.C. Fishburn and H.O. Pollak, “Fixed route cost allocation,”American Mathematical Monthly 90 (1983) 366–378.
4. E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan and D.B. Shmoys, eds.,The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization (Wiley, New York, 1985).
5. W.F. Lucas, “Applications of cooperative games to equitable allocations,” in:Game Theory and its Applications, Proceedings of Symposia in Applied Mathematics, Vol. 24, AMS Short Course (American Mathematical Society, Providence, RI, 1981).