A tabu search heuristic for the generalized minimum spanning tree problem

European Journal of Operational Research

Volumn 191, Issue 2, 2008, Pages 306-319

  Öncan, Temel ^a   Cordeau, Jean François ^b   Laporte, Gilbert ^b  

^a GALATASARAY UNIVERSITY   (Turkey)

^b HEC MONTRÉAL   (Canada)

Author keywords

Generalized minimum spanning tree; Tabu search

Indexed keywords

CLUSTER ANALYSIS; GENETIC ALGORITHMS; HEURISTIC METHODS; PROBLEM SOLVING; TABU SEARCH;

COST TREES; GENERALIZED MINIMUM SPANNING TREES;

TREES (MATHEMATICS);

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

References (28)

1. Ahuja R.K., Magnanti T.L., and Orlin J.B. Network Flows: Theory, Algorithms and Applications (1993), Prentice-Hall, Englewood Cliffs, NJ
2. Chopra S., and Rao M.R. The Steiner tree problem I: Formulations, compositions and extension of facets. Mathematical Programming 64 (1994) 209-229
3. Dror M., Haouari M., and Chaouachi J. Generalized spanning trees. European Journal of Operational Research 120 (2000) 583-592
4. Duin C.W., Volgenant A., and Voss S. Solving group Steiner problems as Steiner problems. European Journal of Operational Research 154 (2004) 323-329
5. Feremans, C., 2001. Generalized spanning tree and extensions. Ph.D. Thesis, Université Libre de Bruxelles.
6. Feremans C., Labbé M., and Laporte G. A comparative analysis of several formulations for the generalized minimum spanning tree problem. Networks 39 (2002) 29-34
7. Feremans C., Labbé M., and Laporte G. The generalized minimum spanning tree problem: Polyhedral analysis and branch-and-cut algorithm. Networks 43 (2004) 71-86
8. Fischetti M., Salazar J., González J., and Toth P. A branch-and-cut algorithm for the symmetric generalized traveling salesman problem. Operations Research 45 (1997) 378-394
9. Ghosh, D., 2003. Solving medium to large sized Euclidean generalized minimum spanning tree problems. Technical report NEP-CMP-2003-09-28 Indian Institute of Management, Research and Publication Department, Ahmedabad, India.
10. Glover F. Future paths for integer programming and links to artificial intelligence. Computers & Operations Research 13 (1986) 533-549
11. Glover F., and Laguna M. Tabu Search (1997), Kluwer, Dordrecht
12. Golden B.L., Raghavan S., and Stanojević D. Heuristic search for the generalized minimum spanning tree problem. INFORMS Journal on Computing 17 (2005) 290-304
13. Golden, B.L., Raghavan, S., Stanojević, D., 2006. Private communication.
14. Haouari M., and Chaouachi J.S. 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. Haouari M., Chaouachi J.S., and Dror M. Solving the generalized minimum spanning tree problem by a branch-and-bound algorithm. Journal of the Operational Research Society 56 (2005) 382-389
16. Haouari M., and Chaouachi J.S. Upper and lower bounding strategies for the generalized minimum spanning tree problem. European Journal of Operational Research 172 (2006) 632-647
17. Hu, B., Leitner, M., Raidl, G.R., 2005. Computing generalized minimum spanning trees with variable neighborhood search. In: Proceedings of the 18th Mini-Euro Conference on Variable Neighborhood Search.
18. Hwang F.K., Richards D.S., and Winter P. The Steiner Tree Problem (1992), North-Holland, Amsterdam
19. Kruskal J.B. On the shortest spanning tree of graph and the travelling salesman problem. Proceedings of the American Mathematical Society 7 (1956) 48-50
20. Myung Y.S., Lee C.H., and Tcha D.W. On the generalized minimum spanning tree problem. Networks 26 (1995) 231-241
21. Pop, P.C., 2002. The generalized minimum spanning tree problem. Ph.D. Thesis, University of Twente, The Netherlands.
22. Pop P.C. On the prize collecting generalized minimum spanning tree problem. Annals of Operations Research 150 (2007) 193-204
23. Pop P.C., Kern W., and Still G. A new relaxation method for the generalized minimum spanning tree problem. European Journal of Operational Research 170 (2006) 900-908
24. Prim R.C. Shortest connection networks and some generalizations. Bell Technical Journal 36 (1957) 1389-1401
25. Reinelt G. TSPLIB - a traveling salesman problem library. INFORMS Journal on Computing 3 (1991) 376-384
26. Taillard E.D. Parallel iterative search methods for vehicle routing problems. Networks 23 (1993) 661-673
27. Takahashi H., and Matsuyama A. An approximate solution for the Steiner problem in graphs. Mathematica Japonica 24 (1980) 573-577
28. Wang Z., Che C.H., and Lim A. Tabu search for generalized minimum spanning tree problem. In: Yang Q., and Webb G. (Eds). PRICAI 2006, LNAI Vol. 4099 (2006), Springer-Verlag, Berlin, Heidelberg 918-922