Combining Lagrangian Decomposition with an Evolutionary Algorithm for the Knapsack Constrained Maximum Spanning Tree Problem - researchr publication related

researchr

You are not signed in
Sign in
Sign up

Sandro Pirkwieser, Günther R. Raidl, Jakob Puchinger. Combining Lagrangian Decomposition with an Evolutionary Algorithm for the Knapsack Constrained Maximum Spanning Tree Problem. In Carlos Cotta, Jano I. van Hemert, editors, Evolutionary Computation in Combinatorial Optimization, 7th European Conference, EvoCOP 2007, Valencia, Spain, April 11-13, 2007, Proceedings. Volume 4446 of Lecture Notes in Computer Science, pages 176-187, Springer, 2007. [doi]

The following publications are possibly variants of this publication:

A Lagrangian Decomposition/Evolutionary Algorithm Hybrid for the Knapsack Constrained Maximum Spanning Tree ProblemSandro Pirkwieser, Günther R. Raidl, Jakob Puchinger. In Carlos Cotta, Jano I. van Hemert, editors, Recent Advances in Evolutionary Computation for Combinatorial Optimization. Volume 153 of Studies in Computational Intelligence, pages 69-85, Springer, 2008. [doi]

An efficient evolutionary algorithm for the degree-constrained minimum spanning tree problemGünther R. Raidl. cec 2000: 104-111 [doi]

runs on WebDSL