Generalized spanning trees

European Journal of Operational Research

Volumn 120, Issue 3, 2000, Pages 583-592

  Dror, M ^a   Haouari, M ^b   Chaouachi, J ^b  

^a UNIVERSITY OF ARIZONA   (United States)

^b UNIVERSITY OF CARTHAGE   (Tunisia)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; CRITICAL PATH ANALYSIS; GENETIC ALGORITHMS; GRAPHIC METHODS; HEURISTIC METHODS; IRRIGATION; MATHEMATICAL MODELS; PROBLEM SOLVING; TREES (MATHEMATICS);

MINIMUM SPANNING TREE; STEINER PROBLEMS; WORST CASE ANALYSIS;

TRAVELING SALESMAN PROBLEM;

EID: 0033908431     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(99)00006-5     Document Type: Article

References (23)

1. Ahuja, R.K., Magnanti, T.L., Orlin, J.B., 1993. Network Flows, Theory, Algorithms, and Applications. Prentice-Hall, Upper Saddle River, NJ.
2. Dror M., Gavish B., Choquette J. Directed Steiner tree problem on graph: Models, relaxations, and algorithms. INFOR. 28:1990;266-281.
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. Gavish B. Formulations and algorithms for the capacitated minimal directed tree problem. J. ACM. 30:1983;118-132.
6. Gavish B. Augmented Lagrangian based algorithms for centralized network design. IEEE Transactions Communications. 33:1985;1247-1257.
7. Goemans M.X., Bertsimas D.J. Survivable networks, linear programming relaxations and the parsimonious property. Mathematical Programming. 60:1993;145-166.
8. Goldberg, D.E., 1989. Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley, Reading, MA.
9. Held M., Karp R.M. The traveling salesman problem and minimum spanning trees. Part II. Mathematical Programming. 1:1971;6-25.
10. Holland, J.H., 1975. Adaptation in Natural and Artificial Systems. The University of Michigan Press, Ann Arbor, MI.
11. Hu, T.C., Kuh, E.S. (Eds.), 1985. VLSI Layout: Theory and Design. IEEE Press, New York, NY.
12. Hwang, F.W., Richards, D.C., Winter, P., 1992. The Steiner Tree Problem, Annals Of Discrete Mathematics vol. 53, North-Holland, Amsterdam.
13. Magnanti T.L., Vachani R. A strong cutting plane algorithm for production scheduling with changeover costs. Operations Research. 38:1990;456-473.
14. Magnanti, T.L., Wolsey, L.A., 1995. Optimal trees, In: Ball, M.O., et al. (Eds.), Handbooks in OR & MS, vol. 7, pp. 503-615.
15. Minoux M. Efficient greedy heuristics for steiner tree problems using reoptimization and supermodularity. INFOR. 28:1990;221-233.
16. Noon C.E., Bean J.C. An efficient transformation of the generalized traveling salesman problem. INFOR. 31:1993;39-44.
17. Plesnik J. Heuristics for the steiner problem in graphs. Discrete Applied Mathematics. 37/38:1992;451-463.
18. Prim C. Shortest connection networks and some generalizations. Bell System Technological Journal. 36:1957;1389-1401.
19. Schwartz, M. 1977. Computer and Communications Network Design and Analysis. Prentice-Hall, Englewood Cliffs, NJ.
20. Takahashi H., Matsuyama A. An approximate solution for the steiner problem in graphs. Mathematica Japonica. 24:1980;573-577.
21. Voβ S. Steiner's problem in graphs: heuristic methods. Discrete Applied Mathematics. 40:1992;45-72.
22. Winter P. Steiner problem in networks: A survey. Networks. 17:1987;129-167.
23. Wong R.T. A dual ascent approach for Steiner tree problems on a directed graph. Mathematical Programming. 28:1984;271-287.