Computing near‐optimal solutions to the steiner problem in a graph using a genetic algorithm
From MaRDI portal
Publication:4894856
DOI10.1002/net.3230260403zbMath0856.90115MaRDI QIDQ4894856
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
90C35: Programming involving graphs or networks
68T05: Learning and adaptive systems in artificial intelligence
Related Items
Improved algorithms for the Steiner problem in networks, Digital data networks design using genetic algorithms, Viral systems: A new bio-inspired optimisation approach, A hybrid Lagrangian genetic algorithm for the prize collecting Steiner tree problem, Unnamed Item, Bandwidth-Delay Constrained Least Cost Multicast Routing for Multimedia Communication
Uses Software
Cites Work