1. Ahuja, R.K., Magnanti, T.L., Orlin, J.B., 1993. Network Flows, Theory, Algorithms, and Applications. Prentice-Hall, Upper Saddle River, NJ
2. Directed Steiner tree problem on graph: Models, relaxations, and algorithms;Dror;INFOR,1990
3. Francis, R.L., McGinnis, L.F., White, J.A., 1992. Facility Layout and Location: An Analytic Approach. Prentice-Hall, Englewood Cliffs, NJ
4. Garey, M.R., Johnson, D.S., 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco, CA
5. Formulations and algorithms for the capacitated minimal directed tree problem;Gavish;J. ACM,1983