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

Abstract

Full Citation:

Sandro Pirkwieser. A Lagrangian Decomposition Approach Combined with Metaheuristics for the Knapsack Constrained Maximum Spanning Tree Problem. October 2006, Master’s thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. (Note: supervised by G.~Raidl and J.~Puchinger)

Type