A Lagrangian Decomposition/Evolutionary Algorithm Hybrid for the Knapsack Constrained Maximum Spanning Tree Problem

Sandro Pirkwieser, Günther Raidl, Jakob Puchinger
January 2008
PDF bib

Abstract

Full Citation:

Sandro Pirkwieser, Günther R. Raidl, Jakob Puchinger. A Lagrangian Decomposition/Evolutionary Algorithm Hybrid for the Knapsack Constrained Maximum Spanning Tree Problem. Chapter in Recent Advances in Evolutionary Computation for Combinatorial Optimization (C. Cotta and J. van~Hemert), volume 153 of Studies in Computational Intelligence, pages 69-85, 2008, Springer. (Note: previous technical report version at https://www.ac.tuwien.ac.at/files/pub/pirkwieser-07a.pdf)

Type
Book Section
Evolcomp Hybrid Netdesign
Günther Raidl
Günther Raidl

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