Upper and lower bounding strategies for the generalized minimum spanning tree problem

European Journal of Operational Research

Volumn 171, Issue 2, 2006, Pages 632-647

  Haouari, Mohamed ^a   Chaouachi, Jouhaina Siala ^a,b  

^a UNIVERSITY OF CARTHAGE   (Tunisia)

^b UNIVERSITY OF CARTHAGE   (Tunisia)

Author keywords

Generalized minimum spanning tree; Genetic algorithm; Lagrangian relaxation; Randomized greedy heuristic; Steiner tree

Indexed keywords

ALGORITHMS; GEOMETRICAL OPTICS; GRAPH THEORY; HEURISTIC METHODS; MATHEMATICAL PROGRAMMING; STOCHASTIC CONTROL SYSTEMS;

GENERALIZED MINIMUM SPANNING TREE PROBLEM; GENETIC ALGORITHM; LAGRANGIAN RELAXATION; STEINER TREE; UPPER AND LOWER BOUNDING STRATEGIES;

STRATEGIC MATERIALS;

EID: 28244450336     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2004.07.072     Document Type: Article

References (28)

1. R.K. Ahuja, and J.B. Orlin Developing fitter genetic algorithms INFORMS Journal on Computing 9 1997 251 253
2. R. Ahuja, T.L. Magnanti, J.B. Orlin, and M.R. Reddy Applications of network optimization M.O. Ball C.L. Monma G.L. Nemahauser Handbooks in Operations Research and Management Science vol. 7 1995 Elsevier Science Amsterdam 1 83
3. J. Beasley An SST-based algorithm for the Steiner problem on graphs Networks 19 1989 1 16
4. R.M. Brady Optimization strategies gleaned from biological evolution Nature 317 1985 804 806
5. Chaouachi, J.S., 2003. Exact and Heuristic Algorithms for the Generalized Minimum Spanning Tree Problem. Unpublished Ph.D. Dissertation. Laboratory of Mathematical Engineering, Tunisia Polytechnic School.
6. S. Chopra, and C.Y. Tsai Polyhedral approaches for the Steiner tree problem on graphs X. Cheng D.Z. Du Steiner Trees in Industry 2001 Kluwer Academic Publishers 235 279
7. M. Dror, M. Haouari, and J. Chaouachi Generalized spanning trees European Journal of Operational Research 120 2000 583 592
8. C.W. Duin, A. Volgenant, and S. Voß Solving group Steiner problems as Steiner problems European Journal of Operational Research 154 2004 323 329
9. Feremans, C., 2001. Generalized Spanning Trees and Extensions. Ph.D. Dissertation. Université Libre de Bruxelles.
10. C. Feremans, M. Labbé, and G. Laporte On generalized minimum spanning trees European Journal of Operational Research 134 2001 457 458
11. C. Feremans, M. Labbé, and G. Laporte A comparative analysis of several formulations for the generalized minimum spanning tree problem Networks 39 2002 29 34
12. M.X. Goemans, and Y. Myung A catalog of Steiner tree formulations Networks 23 1993 19 28
13. R.L. Graham, and P. Hell On the history of minimum spanning tree problem Annals of the History of Computing 7 1985 43 57
14. M. Haouari, and S.J. Chaouachi A probabilistic greedy search algorithm for combinatorial optimization with application to the set covering problem Journal of the Operational Research Society 53 2002 792 799
15. F.K. Hwang, D.S. Richards, and P. Winter The Steiner Tree Problem 1992 North-Holland Amsterdam
16. E. Ihler, G. Reich, and P. Widmayer Class Steiner trees and VLSI-design Discrete Applied Mathematics 90 1999 173 194
17. A.R. Kansal, and S. Torquato Globally and locally minimal weight spanning tree networks Physica A 301 2001 601 619
18. J.B. Kruskal On the shortest spanning tree of graph and the traveling salesman problem Proceedings of the American Mathematical Society 7 1956 48 50
19. C.L. Lu, C.Y. Tang, and R.C.T. Lee The full Steiner tree problem Theoretical Computer Science 306 2003 55 67
20. Lucena, A., 1991. Tight bounds for the Steiner problem in graphs. Talk given at the TIMS-SOBRAPO Joint International Meeting, Rio de Janeiro.
21. T.L. Magnanti, and L.A. Wolsey Optimal trees M.O. Ball C.L. Monma G.L. Nemhauser Handbooks in Operations Research and Management Science vol. 7 1995 Elsevier Science Amsterdam 503 615
22. Y.S. Myung, C.H. Lee, and D.W. Tcha On the generalized minimum spanning tree problem Networks 26 1995 231 241
23. G.L. Nemhauser, and L.A. Wolsey Integer and Combinatorial Optimization 1988 Wiley Chichester
24. C.R. Reeves Genetic algorithms for the operations researcher INFORMS Journal on Computing 9 1997 231 250
25. S.J. Shyu, P.Y. Yin, B.M.T. Lin, and M. Haouari Ant-tree: An ant colony optimization approach to the generalized minimum spanning tree problem Journal of Experimental and Theoretical Artificial Intelligence 15 2003 103 112
26. H. Takahashi, and A. Matsuyama An approximate solution for the Steiner problem in graphs Mathematica Japonica 24 1980 573 577
27. E. Tsang, and C. Voudouris Guided local search and its application to the travelling salesman problem European Journal of Operational Research 113 1999 469 499
28. R.T. Wong A dual ascent approach for Steiner tree problems on a directed graph Mathematical Programming 28 1984 271 287