1. Fulkerson, D. R.,Increasing the Capacity of a Network, Management Science, Vol. 5, pp. 472?483, 1959.
2. Beale, E. M. L., andTomlin, J. A.,Special Facilities in a Generalized Mathematical Programming System for Nonconvex Problems Using Ordered Sets of Variables, 5th International Conference on Operations Research, Edited by J. Lawrence, Tavistock Publications, London, England, 1969.
3. Tomlin, J. A.,Branch and Bound Methods for Integer and Non-Convex Programming, Integer and Nonlinear Programming, Edited by J. Abadie, North-Holland Publishing Company, Amsterdam, Holland, 1970.
4. Price, W. L.,Increasing the Capacity of a Network Where the Costs Are Non-Linear: A Branch-and-Bound Algorithm, CORS Journal, Vol. 5, pp. 110?114, 1967.
5. Yaged, B., Jr.,Minimum Cost Routing for Static Network Models, Networks, Vol. 1, pp. 139?172, 1971.