Computing near‐optimal solutions to the steiner problem in a graph using a genetic algorithm

DOI10.1002/net.3230260403zbMath0856.90115OpenAlexW2163210218MaRDI QIDQ4894856

Henrik Esbensen

Publication date: 3 February 1997

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230260403

zbMATH Keywords

genetic algorithmheuristicbranch-and-cut algorithmsSteiner problem in a graph

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Learning and adaptive systems in artificial intelligence (68T05)

Related Items (9)

Solving Steiner trees: Recent advances, challenges, and perspectives ⋮ Optimizing the Design of a Wind Farm Collection Network ⋮ A survey of repair methods used as constraint handling techniques in evolutionary algorithms ⋮ The pilot method: A strategy for heuristic repetition with application to the Steiner problem in graphs ⋮ Viral systems: A new bio-inspired optimisation approach ⋮ A hybrid Lagrangian genetic algorithm for the prize collecting Steiner tree problem ⋮ Improved algorithms for the Steiner problem in networks ⋮ Bandwidth-Delay Constrained Least Cost Multicast Routing for Multimedia Communication ⋮ Digital data networks design using genetic algorithms

Uses Software

• OR-Library

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Computing near‐optimal solutions to the steiner problem in a graph using a genetic algorithm