People
Research
Courses
Updates
Jobs
Contact
Internal
Light
Dark
Automatic
A Lagrangian Decomposition/Evolutionary Algorithm Hybrid for the Knapsack Constrained Maximum Spanning Tree Problem
Sandro Pirkwieser
,
Günther Raidl
,
Jakob Puchinger
January 2008
PDF
Cite
Type
Book Section
Evolcomp
Hybrid
Netdesign
Günther Raidl
Günther Raidl is a Professor at the Algorithms and Complexity Group.
Cite
×