A hybridised GA for the Steiner minimal tree problem

DOI10.1007/3-540-45750-X_32MaRDI QIDQ4411269zbMATH OpenFDO

Authors R. Panadero, José-Luis Fernández-Villacañas

Publication date 7 July 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2464/24640234.htm

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computing methodologies and applications (68U99)

Recommendations

• Solving the Graphical Steiner Tree Problem Using Genetic Algorithms
• Computing near‐optimal solutions to the steiner problem in a graph using a genetic algorithm
• scientific article; zbMATH DE number 5670036
• A Genetic Algorithm for Solving the Euclidean Non-Uniform Steiner Tree Problem
• scientific article; zbMATH DE number 1163723

Cited in

(8)

• Genetic operators of an evolutionary model for the Steiner flow problem
• A Genetic Algorithm for Solving the Euclidean Non-Uniform Steiner Tree Problem
• Dynamic Programming Driven Memetic Search for the Steiner Tree Problem with Revenues, Budget, and Hop Constraints
• scientific article; zbMATH DE number 1163723 (Why is no real title available?)
• scientific article; zbMATH DE number 1852707 (Why is no real title available?)
• Computing near‐optimal solutions to the steiner problem in a graph using a genetic algorithm
• Solving the Graphical Steiner Tree Problem Using Genetic Algorithms
• Computational Science - ICCS 2004

This page was built for publication: A hybridised GA for the Steiner minimal tree problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4411269)