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

DOI10.1007/978-3-540-70807-0_5zbMath1159.90500OpenAlexW1492069318MaRDI QIDQ3625008

Sandro Pirkwieser, Jakob Puchinger, Günther R. Raidl

Publication date: 7 May 2009

Published in: Recent Advances in Evolutionary Computation for Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-70807-0_5

zbMATH Keywords

local searchhybrid approachLagrangian decompositionevolutionary algorithmvolume algorithmknapsack constrained maximum spanning tree

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items (1)

Combining (Integer) Linear Programming Techniques and Metaheuristics for Combinatorial Optimization

Uses Software

• Knapsack

This page was built for publication: A Lagrangian Decomposition/Evolutionary Algorithm Hybrid for the Knapsack Constrained Maximum Spanning Tree Problem