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

Sandro Pirkwieser, Günther Raidl, Jakob Puchinger
January 2007
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. 2007, Technical report TR 186-1-07-03, Institute of Computer Graphics and Algorithms, Vienna University of Technology.

Type
Technical Report
Evolcomp Hybrid Netdesign
Günther Raidl
Günther Raidl

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