A GRASP algorithm with RNN based local search for designing a WAN access network

Electronic Notes in Discrete Mathematics

Volumn 18, Issue , 2004, Pages 59-65

  Cancela, Héctor ^a   Robledo, Franco ^a,b   Rubino, Gerardo ^b  

^a UNIVERSIDAD DE LA REPÚBLICA   (Uruguay)

^b CAMPUS DE BEAULIEU   (France)

Author keywords

GRASP; metaheuristic; RNN; topological design

Indexed keywords

EID: 34247172193     PISSN: 15710653     EISSN: 15710653     Source Type: Journal    
DOI: 10.1016/j.endm.2004.06.010     Document Type: Article

References (8)

1. Gelenbe E. Stability of the random neural network model. Neural Computation 5 2 (1990) 239-247
2. Gelenbe E., and Batty F. Minimum cost graph covering with the random neural network. Computer Science and Operations Research (1992), Pergamon, New York 139-147
3. E. Gelenbe, V. Koubi, and F. Pekergin, "Dynamical random neural network approach to the traveling salesman problem", in Proc. Symp. Syst., Man., Cybern., pp. 630-635 (1993)
4. Feo T.A., and Resende M.G.C. Greedy randomized adaptive search procedures. Journal of Global Optimization 6 (1995) 109-133
5. M. Priem and F. Priem, "Ingénierie des WAN", ISBN 2-10-004510-5, Dunod InterEditions (1999)
6. Randazzo C.D., Luna H.P.L., and Mahey P. Benders decomposition for local access network design with two technologies. Discrete Math.& Theoretical Comp. Science 4 2 (2001) 235-246
7. http://elib.zib.de/steinlib/testset.php (last access: April 28, 2004)
8. Takahashi H., and Matsuyama A. An approximate solution for the Steiner problem in graphs. Math. Jpn. 24 (1980) 537-577