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

Sandro Pirkwieser, Günther R. Raidl, Jakob Puchinger
2008 Studies in Computational Intelligence  
We present a Lagrangian decomposition approach for the Knapsack Constrained Maximum Spanning Tree problem yielding upper bounds as well as heuristic solutions. This method is further combined with an evolutionary algorithm to a sequential hybrid approach. Thorough experimental investigations, including a comparison to a previously suggested simpler Lagrangian relaxation based method, document the advantages of our approach. Most of the upper bounds derived by Lagrangian decomposition are
more » ... , and when additionally applying local search (LS) and combining it with the evolutionary algorithm, large and supposedly hard instances can be either solved to provable optimality or with a very small remaining gap in reasonable time.
doi:10.1007/978-3-540-70807-0_5 fatcat:bto46x4ginebrc4fdp4qjefd2i