A Lagrangian Decomposition Approach Combined with Metaheuristics for the Knapsack Constrained Maximum Spanning Tree Problem

Pirkwieser, Sandro

by Sandro Pirkwieser

Reference:

A Lagrangian Decomposition Approach Combined with Metaheuristics for the Knapsack Constrained Maximum Spanning Tree ProblemSandro PirkwieserOct 2006, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms.Note: supervised by G. Raidl and J. Puchinger

Bibtex Entry:

@mastersthesis{pirkwieser_06,
author = {Sandro Pirkwieser},
title = {A {L}agrangian Decomposition Approach Combined with Metaheuristics for the Knapsack Constrained Maximum Spanning Tree Problem},
school = {Vienna University of Technology, Institute of Computer
Graphics and Algorithms},
address = {Vienna, Austria},
month = Oct,
year = {2006},
url = {https://www.ac.tuwien.ac.at/files/pub/pirkwieser_06.pdf},
note = {supervised by G.~Raidl and J.~Puchinger},
keywords = {evolcomp,hybrid,netdesign},
}