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 Puchinger2007, Technical report TR 186–1–07–03, Institute of Computer Graphics and Algorithms, Vienna University of Technology.

Bibtex Entry:

@TECHREPORT{pirkwieser-07a,
author = {Sandro Pirkwieser and G\"unther R. Raidl and Jakob Puchinger},
title = {A {L}agrangian Decomposition/Evolutionary Algorithm Hybrid for the Knapsack Constrained Maximum Spanning Tree Problem},
institution = {Institute of Computer Graphics and Algorithms, Vienna University of Technology},
address = {Vienna, Austria},
year = {2007},
number = {TR 186--1--07--03},
url = {https://www.ac.tuwien.ac.at/files/pub/pirkwieser-07a.pdf},
keywords = {hybrid,evolcomp,netdesign}
}