An encoding in metaheuristics for the minimum communication spanning tree problem

DOI10.1287/IJOC.1080.0310zbMATH Open1243.90038OpenAlexW2139151433WikidataQ58205460 ScholiaQ58205460MaRDI QIDQ2899024FDOQ2899024

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

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

Cited In (2)

• Dynamic Programming Driven Memetic Search for the Steiner Tree Problem with Revenues, Budget, and Hop Constraints
• A PTAS for the metric case of the minimum sum-requirement communication spanning tree problem

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)