Solving the Graphical Steiner Tree Problem Using Genetic Algorithms
From MaRDI portal
Publication:5289351
DOI10.1057/jors.1993.69zbMath0774.90083OpenAlexW2118720660MaRDI QIDQ5289351
No author found.
Publication date: 23 August 1993
Published in: Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1057/jors.1993.69
Programming involving graphs or networks (90C35) Learning and adaptive systems in artificial intelligence (68T05) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items (11)
Hybrid genetic algorithms for bin-packing and related problems ⋮ Metaheuristics: A bibliography ⋮ Solving Steiner trees: Recent advances, challenges, and perspectives ⋮ The pilot method: A strategy for heuristic repetition with application to the Steiner problem in graphs ⋮ Comparison and hybridization of crossover operators for the nurse scheduling problem ⋮ A hybrid scatter search heuristic for personalized crew rostering in the airline industry ⋮ A hybrid Lagrangian genetic algorithm for the prize collecting Steiner tree problem ⋮ A genetic algorithm for task scheduling on heterogeneous computing systems using multiple priority queues ⋮ Combinatorial optimization in system configuration design ⋮ Summarizing a set of time series by averaging: from Steiner sequence to compact multiple alignment ⋮ Digital data networks design using genetic algorithms
This page was built for publication: Solving the Graphical Steiner Tree Problem Using Genetic Algorithms
