Sciweavers

Share
2 search results - page 1 / 1
» Encoding Bounded-Diameter Spanning Trees with Permutations a...
Sort
View
GECCO
2004
Springer
129views Optimization» more  GECCO 2004»
11 years 5 months ago
Encoding Bounded-Diameter Spanning Trees with Permutations and with Random Keys
Permutations of vertices can represent constrained spanning trees for evolutionary search via a decoder based on Prim’s algorithm, and random keys can represent permutations. Tho...
Bryant A. Julstrom
SAC
2003
ACM
11 years 5 months ago
Greedy Heuristics and an Evolutionary Algorithm for the Bounded-Diameter Minimum Spanning Tree Problem
Given a connected, weighted, undirected graph G and a bound D, the bounded-diameter minimum spanning tree problem seeks a spanning tree on G of lowest weight in which no path betw...
Günther R. Raidl, Bryant A. Julstrom
books