An Evolutionary Algorithm with Stochastic Hill-Climbing for the Edge-Biconnectivity Augmentation Problem

I. Ljubić, Günther Raidl
January 2001
PDF bib

Abstract

Full Citation:

I. Ljubić, G. R. Raidl. An Evolutionary Algorithm with Stochastic Hill-Climbing for the Edge-Biconnectivity Augmentation Problem. Applications of Evolutionary Computing: EvoWorkshops 2001 (E. J.-W. Boers and others), volume 2037 of LNCS, pages 20-29, 2001, Springer.

Type
Conference Paper
Evolcomp Hybrid Netdesign
Günther Raidl
Günther Raidl

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