An encoding in metaheuristics for the minimum communication spanning tree problem
From MaRDI portal
Recommendations
- The link and node biased encoding revisited: Bias and adjustment of parameters
- 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
- A new genetic algorithm for the optimal communication spanning tree problem
Cited in
(5)- A PTAS for the metric case of the minimum sum-requirement communication spanning tree problem
- The link and node biased encoding revisited: Bias and adjustment of parameters
- 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?
- Making the edge-set encoding fly by controlling the bias of its crossover operator
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)