1. Balinski, M. L. “Fixed Cost Transportation Problems,”Naval Research Logistic Quarterly, Vol. 8 (1961), pp. 41–54.
2. Beale, E. M. L. and R. E. Small. “Mixed Integer Programming by a Branch and Bound Technique,”Proc. IFIP Congress 65, Vol. 2 (1966), pp. 450–451.
3. Boyce, D. E., A. Farhi and R. Weischedel, “Optimal Network Problem: A Branch-and-Bound Algorithm,”Environment and Planning, Vol. 5 (1973), pp. 519–533.
4. , A. Farhi and R. Weischedel.Optimal Subset Selection. Multiple Regression, Interdependence and Optimal Network Algorithms. Berlin: Springer, 1974.
5. Busacker, R. G. and T. L. Saaty.Endliche Graphen und Netzwerke, Munich: Oldenbourg, 1968.