A Memetic Algorithm for Minimum-Cost Vertex-Biconnectivity Augmentation of Graphs

I. Ljubić, Günther Raidl
January 2003
bib

Abstract

Full Citation:

I. Ljubić, G. R. Raidl. A Memetic Algorithm for Minimum-Cost Vertex-Biconnectivity Augmentation of Graphs. Journal of Heuristics, volume 9, pages 401-427, 2003, Kluwer Academic Publishers. (Note: previous technical report version at https://www.ac.tuwien.ac.at/files/pub/ljubic-02.pdf)

Type
Journal Article
Evolcomp Hybrid Netdesign
Günther Raidl
Günther Raidl

Günther Raidl is a Professor at the Algorithms and Complexity Group.