An encoding in metaheuristics for the minimum communication spanning tree problem

DOI10.1287/IJOC.1080.0310MaRDI QIDQ2899024zbMATH OpenOpenAlexWikidataFDO

Authors Franz Rothlauf

Publication date 28 July 2012

Published in INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/3d167ed1b2bef904ca8902439e14b49202425a13

zbMATH Keywords

problem-specific representations trees metaheuristics encodings communication networks

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Approximation methods and heuristics in mathematical programming (90C59) Communication theory (94A05)

Recommendations

• scientific article; zbMATH DE number 1703846
• A solution of real-world OCST problems with a new tree encoding-based genetic algorithm
• Constrained minimal spanning trees solved by a GA with feasible encodings
• A biased random-key genetic algorithm for the capacitated minimum spanning tree problem
• scientific article; zbMATH DE number 1617347

Cited in

(5)

• A PTAS for the metric case of the minimum sum-requirement communication spanning tree problem
• scientific article; zbMATH DE number 1703846 (Why is no real title available?)
• Dynamic Programming Driven Memetic Search for the Steiner Tree Problem with Revenues, Budget, and Hop Constraints
• Is Prüfer code encoding always a bad idea?
• Evolutionary Computation in Combinatorial Optimization

This page was built for publication: An encoding in metaheuristics for the minimum communication spanning tree problem

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