A hybrid heuristic for the diameter constrained minimum spanning tree problem

Journal of Global Optimization

Volumn 46, Issue 3, 2010, Pages 363-381

  Lucena, Abilio ^a   Ribeiro, Celso C ^b   Santos, Andréa C ^c  

^a FEDERAL UNIVERSITY OF RIO DE JANEIRO   (Brazil)

^b FLUMINENSE FEDERAL UNIVERSITY   (Brazil)

^c UNIVERSITÉ CLERMONT AUVERGNE   (France)

Author keywords

Diameter constrained spanning trees; GRASP; Heuristics; Iterated local search; Spanning trees

Indexed keywords

CONSTRAINED MINIMUM SPANNING TREE; HYBRID HEURISTICS; ITERATED LOCAL SEARCH; LOCAL SEARCH; MINIMUM COST; NETWORK DESIGN; OPTIMALITY; QUALITY REQUIREMENTS; SPANNING TREE; TEST SETS; UPPER BOUND;

PARALLEL ARCHITECTURES;

TELECOMMUNICATION NETWORKS;

EID: 77953021159     PISSN: 09255001     EISSN: 15732916     Source Type: Journal    
DOI: 10.1007/s10898-009-9430-2     Document Type: Article

References (31)

1. Abdalla, A.M.: Computing a diameter-constrained minimum spanning tree. PhD thesis, College of Engineering and Computing Science, University of Central Florida, Orlando (2001)
2. Achuthan N.R., Caccetta L., Caccetta P.A., Geelen J.F.: Algorithms for the minimum weight spanning tree with bounded diameter problem. In: Phua, K.H., Wand, C.M., Yeong, W.Y., Leong, T.Y., Loh, H.T., Tan, K.C., Chou, F.S. (eds) Optimization Techniques and Applications, vol. 1, pp. 297-304. World Scientific, Singapore (1992)
3. N.R. Achuthan L. Caccetta P.A. Caccetta J.F. Geelen 1994 Computational methods for the diameter restricted minimum weight spanning tree problem Australas. J. Comb. 10 51 71
4. Bala, K., Petropoulos, K., Stern, E.: Multicasting in a linear lightwave network. In: Proceedings of the IEEE INFOCOM'93 Conference on Computer Communications, vol. 3, pp. 31350-31358. São Francisco (1993)
5. E.J. Beasley 1990 OR-Library: distributing test problems by electronic mail J. Oper. Res. Soc. 41 1069 1072 10.1057/jors.1990.166
6. A. Bookstein S.T. Klein 2001 Compression of correlated bitvectors Inf. Syst. 16 110 118
7. N. Deo A. Abdalla 2000 Computing a diameter-constrained minimum spanning tree in parallel Lect. Notes Comput. Sci. 1767 17 31 10.1007/3-540-46521-9-2
8. Duarte, A.R., Ribeiro, C.C., Urrutia, S., Haeusler, E.H.: Referee assignment in sports leagues. In: Practice and Theory of Automated Timetabling VI, vol. 3867 of Lecture Notes in Computer Science, pp. 158-173. Springer (2007)
9. T.A. Feo M.G.C. Resende 1989 A probabilistic heuristic for a computationally difficult set covering problem Oper. Res. Lett. 8 67 71 10.1016/0167-6377(89)90002-3
10. Garey M.R., Johnson D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. WH Freeman, New York (1979)
11. Gouveia L., Magnanti T.L.: Modelling and Solving the Diameter-Constrained Minimum Spanning Tree Problem, Technical Report. Departamento de Estatística e Investigação Operational, Faculdade de Ciências, Lisboa (2000)
12. L. Gouveia T.L. Magnanti 2003 Network flow models for designing diameter-constrained minimum-spanning and steiner trees Networks 41 159 173 10.1002/net.10069
13. L. Gouveia T.L. Magnanti C. Requejo 2004 A 2-path approach for odd-diameter-constrained minimum spanning and steiner trees Networks 44 254 265 10.1002/net.20034
14. Gruber, M., Raidl, G.R.: A new 0-1 ILP approach for the bounded diameter minimum spanning tree problem. In: Gouveia, L., Mourão, C. (eds.) Proceedings of the 2nd International Network Optimization Conference, vol. 1, pp. 178-185, Lisbon (2005)
15. Gruber, M., Raidl, G.R.: Variable neighborhood search for the bounded diameter minimum spanning tree problem. In: Hansen, P., Mladenovic, N., Pérez, J.A.M., Batista, B.M., MorenoVega, J.M. (eds.) (2005) Proceedings of the 18th Mini Euro Conference on Variable Neighborhood Search, pp. 1-11. Tenerife
16. Guedes, A.C.B., Ribeiro, C.C.: A hybrid heuristic for minimizing weighted carry-over effects in round robin tournaments (2009) (Submitted)
17. G.Y. Handler 1978 Minimax location of a facility in an undirected graph Transp. Sci. 7 287 293 10.1287/trsc.7.3.287
18. P. Hansen N. Mladenović 2001 Variable neighborhood search: principles and applications Euro. J. Oper. Res. 130 449 467 10.1016/S0377- 2217(00)00100-4 (Pubitemid 32875304)
19. Hansen P., Mladenović N.: Developments of variable neighborhood search. In: Ribeiro, C.C., Hansen, P. Essays and Surveys in Metaheuristics, pp. 415-439. Kluwer, Boston (2002)
20. J.P. Hart A.W. Shogan 1987 Semi-greedy heuristics: An empirical study Oper. Res. Lett. 6 107 114 10.1016/0167-6377(87)90021-6 (Pubitemid 17632868)
21. Julstrom, B., Raidl, G.R.: A permutation-coded evolutionary algorithm for the bounded-diameter minimum spanning tree problem. In: Barry, A., Rothlauf, F., Thierens, D., et al. (eds.) The Genetic and Evolutionary Computation Conference's Workshops Proceedings, Workshop on Analysis and Design of Representations, pp. 2-7. Chicago (2003)
22. B. A. Julstrom 2004 Encoding bounded-diameter minimum spanning trees with permutations and with random keys Lect. Notes Comput. Sci. 3102 1272 1281
23. Lourenço, H.R., Martin, O.C., Stutzle, T.: Iterated local search. In: Glover F., KochenbergerG. Handbook of Metaheuristics, pp. 321-353. Kluwer, Boston (2002)
24. M. Prais C.C. Ribeiro 2000 Reactive GRASP: an application to a matrix decomposition problem in TDMA traffic assignment INFORMS J. Comput. 12 164 176 10.1287/ijoc.12.3.164.12639
25. R.C. Prim 1957 Shortest connection networks and some generalizations Bell Syst. Tech. J. 36 1389 1401
26. Raidl, G.R., Julstrom, B.A. : Greedy heuristics and an evolutionary algorithm for the bounded-diameter minimum spanning tree problem. In: Proceedings of the 18th ACM Symposium on Applied Computing, pp. 747-752. Melbourne (USA) (2003)
27. K. Raymond 1989 A tree-based algorithm for distributed mutual exclusion ACM Trans. Comput. 7 61 77 10.1145/58564.59295
28. Requejo, C.: Modelos para o problema da árvore geradora de suporte com restrição de diâmetro: caso do diâmetro ímpar. PhD thesis, Universidade de Lisboa Faculdade de Ciências, Lisboa (2003)
29. Resende M.G.C., Ribeiro C.C.: Greedy randomized adaptive search procedures. In: Glover, F., Kochenberger, G. (eds) Handbook of Metaheuristics, pp. 219-249. Kluwer, Boston (2003)
30. C.C. Ribeiro S. Urrutia 2007 Heuristics for the mirrored traveling tournament problem Euro. J. Oper. Res. 179 775 787 10.1016/j.ejor.2005.03.061 (Pubitemid 46038589)
31. A.C. Santos A. Lucena C.C. Ribeiro 2004 Solving diameter constrained minimum spanning tree problem in dense graphs Lect. Notes Comput. Sci. 3059 458 467