Netdesign

Hybrid Evolutionary Algorithms for Combinatorial Optimization
PDF Cite
A Memetic Algorithm for Minimum-Cost Vertex-Biconnectivity Augmentation of Graphs
Cite
A Permutation-Coded Evolutionary Algorithm for the Bounded-Diameter Minimum Spanning Tree Problem
PDF Cite
Edge-Sets: An Effective Evolutionary Coding of Spanning Trees
Cite
Greedy Heuristics and an Evolutionary Algorithm for the Bounded-Diameter Minimum Spanning Tree Problem
PDF Cite
A Memetic Algorithm for Vertex-Biconnectivity Augmentation
PDF Cite
Evolutionary Local Search for the Edge-Biconnectivity Augmentation Problem
Cite
Initialization is Robust in Evolutionary Algorithms that Encode Spanning Trees as Sets of Edges
PDF Cite
On Weight-Biased Mutation for Graph Problems
PDF Cite
An Evolutionary Algorithm with Stochastic Hill-Climbing for the Edge-Biconnectivity Augmentation Problem
PDF Cite