A memetic algorithm for the optimum communication spanning tree problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4771 LNCS, Issue , 2007, Pages 170-184

  Fischer, Thomas ^a   Merz, Peter ^a  

^a Rheinland Pfälzische Technische Universität Kaiserslautern Landau   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COST FUNCTIONS; TELECOMMUNICATION LINKS; TREES (MATHEMATICS);

COMMUNICATION VOLUME; MEMETIC ALGORITHMS;

PROBLEM SOLVING;

EID: 38149032879     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-75514-2_13     Document Type: Conference Paper

References (13)

1. Hu, T.C.: Optimum Communication Spanning Trees. SIAM Journal of Computing 3(3), 188-195 (1974)
2. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, San Francisco, CA, USA (1979)
3. Wu, B.Y., Chao, K.M., Tang, C.Y.: Approximation algorithms for some optimum communication spanning tree problems. Discr. Appl. Math. 102(3), 245-266 (2000)
4. Ahuja, R.K., Murty, V.V.S.: Exact and Heuristic Algorithms for the Optimum Communication Spanning Tree Problem. Transp. Sci. 21(3), 163-170 (1987)
5. Palmer, C.C., Kershenbaum, A.: Two Algorithms for Finding Optimal Communication Spanning Trees. Technical Report RC 19394, IBM T. J. Watson Research Center, Yorktown Heights, NY, USA (1994)
6. Palmer, C.C., Kershenbaum, A.: Representing trees in genetic algorithms. In: Proceedings of the First IEEE Conf. Evo. Comp., vol. 1, pp. 379-384 (1994)
7. Soak, S.M.: A New Evolutionary Approach for the Optimal Communication Spanning Tree Problem. E89-A(10), 2882-2893 (2006)
8. Back, T.: Evolutionary Algorithms in Theory and Practice. Oxford University Press, New York (1996)
9. Hoos, H.H., Stützle, T.: Stochastic Local Search: Foundations and Applications. The Morgan Kaufmann Series in Artificial Intelligence. Morgan Kaufmann, San Francisco (2004)
10. Merz, P.: Memetic Algorithms for Combinatorial Optimization Problems: Fitness Landscapes and Effective Search Strategies. PhD thesis, University of Siegen, Germany, Siegen, Germany (2000)
11. Rothlauf, F., Gerstacker, J., Heinzl, A.: On the Optimal Communication Spanning Tree Problem. Working Papers in Information Systems 10/2003, University of Mannheim, Germany (2003)
12. Fischer, T.: Improved Local Search for Large Optimum Communication Spanning Tree Problems. In: MIC 2007. 7th Metaheuristics International Conference (2007)
13. Rothlauf, F., Heinzl, A.: Developing efficient metaheuristics for communication network problems by using problem-specific knowledge. Technical Report 9/2004, University of Mannheim, Germany (2004)