A grid enabled parallel hybrid genetic algorithm for SPN

DOI10.1007/978-3-540-24685-5_20MaRDI QIDQ5712864zbMATH OpenOpenAlexFDO

Authors Giuseppe Lo Presti, Giuseppe Lo Re, Pietro Storniolo, Alfonso Urso

Publication date 23 December 2005

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

Full work available at URL https://doi.org/10.1007/b97987

zbMATH Keywords

Grid ComputingParallel Genetic AlgorithmSteiner Problem

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Parallel algorithms in computer science (68W10)

Recommendations

• Computing near‐optimal solutions to the steiner problem in a graph using a genetic algorithm
• A hybridised GA for the Steiner minimal tree problem
• Solving the Graphical Steiner Tree Problem Using Genetic Algorithms
• A parallel grasp for the Steiner tree problem in graphs using a hybrid local search strategy
• scientific article; zbMATH DE number 5670036

Cited in

(4)

• A grid-oriented genetic algorithm framework for bioinformatics
• DNA fragment assembly using a grid-based genetic algorithm
• Solving Steiner trees: Recent advances, challenges, and perspectives
• NeuroPrim: an attention-based model for solving NP-hard spanning tree problems

Describes a project that uses

Uses Software

• MPICH-G2

This page was built for publication: A grid enabled parallel hybrid genetic algorithm for SPN

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