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

Pirkwieser, Sandro; Raidl, Günther R.; Puchinger, Jakob

by Sandro Pirkwieser, Günther R. Raidl, Jakob Puchinger

Reference:

A Lagrangian Decomposition/Evolutionary Algorithm Hybrid for the Knapsack Constrained Maximum Spanning Tree ProblemSandro Pirkwieser, Günther R. Raidl, Jakob PuchingerChapter in Recent Advances in Evolutionary Computation for Combinatorial Optimization (C. Cotta, J. van Hemert, eds.), 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

Bibtex Entry:

@INCOLLECTION{pirkwieser-08,
author = {Sandro Pirkwieser and G\"{u}nther R. Raidl and Jakob Puchinger},
title = {A {L}agrangian Decomposition/Evolutionary Algorithm Hybrid for the Knapsack Constrained Maximum Spanning Tree Problem},
booktitle = {Recent Advances in Evolutionary Computation for Combinatorial Optimization},
series = {Studies in Computational Intelligence},
volume = {153},
editor = {C. Cotta and J. van~Hemert},
year = {2008},
pages = {69--85},
publisher = {Springer},
url = {http://www.springer.com/engineering/book/978-3-540-70806-3},
note = {previous technical report version at \url{https://www.ac.tuwien.ac.at/files/pub/pirkwieser-07a.pdf}},
keywords = {hybrid,evolcomp,netdesign}
}