Combining Lagrangian Decomposition with an Evolutionary Algorithm for the Knapsack Constrained Maximum Spanning Tree Problem

  • Sandro Pirkwieser
  • Günther R. Raidl
  • Jakob Puchinger
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4446)


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. Experimental investigations, including a comparison to a previously suggested simpler Lagrangian relaxation based method, document the advantages of the new approach. Most of the upper bounds derived by Lagrangian decomposition are optimal, and together with the evolutionary algorithm, large instances with up to 12000 nodes can be either solved to provable optimality or with a very small remaining gap in reasonable time.


Local Search Planar Graph Knapsack Problem Lagrangian Relaxation Steiner Tree Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Yamamato, Y., Kubo, M.: Invitation to the Traveling Salesman’s Problem (in Japanese). Asakura, Tokyo (1997)Google Scholar
  2. 2.
    Yamada, T., Watanabe, K., Katakoa, S.: Algorithms to solve the knapsack constrained maximum spanning tree problem. Int. Journal of Computer Mathematics 82(1), 23–34 (2005)zbMATHCrossRefGoogle Scholar
  3. 3.
    Pirkwieser, S.: A Lagrangian Decomposition Approach Combined with Metaheuristics for the Knapsack Constrained Maximum Spanning Tree Problem. Master’s thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms (October 2006)Google Scholar
  4. 4.
    Aggarwal, V., Aneja, Y., Nair, K.: Minimal spanning tree subject to a side constraint. Comput. & Operations Res. 9(4), 287–296 (1982)CrossRefGoogle Scholar
  5. 5.
    Jörnsten, K., Migdalas, S.: Designing a minimal spanning tree network subject to a budget constraint. Optimization 19(4), 475–484 (1988)zbMATHMathSciNetGoogle Scholar
  6. 6.
    Fisher, M.L.: The Lagrangian Relaxation Method for Solving Integer Programming Problems. Management Science 27(1), 1–18 (1981)zbMATHMathSciNetGoogle Scholar
  7. 7.
    Fisher, M.L.: An application oriented guide to Lagrangean Relaxation. Interfaces 15, 10–21 (1985)Google Scholar
  8. 8.
    Beasley, J.E.: Lagrangian relaxation. In: Reeves, C.R. (ed.) Modern Heuristic Techniques for Combinatorial Problems, pp. 243–303. John Wiley & Sons Inc., New York (1993)Google Scholar
  9. 9.
    Kruskal, J.B.: On the shortest spanning subtree of a graph and the travelling salesman problem. In: Proc. of the AMS, vol. 7, pp. 48–50 (1956)CrossRefMathSciNetGoogle Scholar
  10. 10.
    Prim, R.C.: Shortest connection networks and some generalizations. Bell Systems Technology Journal 36, 1389–1401 (1957)Google Scholar
  11. 11.
    Fredman, M.L., Sedgewick, R., Sleator, D.D., Tarjan, R.E.: The pairing heap: A new form of self-adjusting heap. Algorithmica 1(1), 111–129 (1986)zbMATHCrossRefMathSciNetGoogle Scholar
  12. 12.
    Kellerer, H., Pferschy, U., Pisinger, D.: Knapsack Problems. Springer, Berlin Heidelberg New York (2004)zbMATHGoogle Scholar
  13. 13.
    Martello, S., Pisinger, D., Toth, P.: Dynamic programming and strong bounds for the 0–1 knapsack problem. Management Science 45, 414–424 (1999)CrossRefGoogle Scholar
  14. 14.
    Barahona, F., Anbil, R.: The volume algorithm: producing primal solutions with a subgradient method. Mathematical Programming 87(3), 385–399 (2000)zbMATHCrossRefMathSciNetGoogle Scholar
  15. 15.
    Haouaria, M., Siala, J.C.: A hybrid Lagrangian genetic algorithm for the prize collecting Steiner tree problem. Comput. & Operations Res. 33(5), 1274–1288 (2006)CrossRefGoogle Scholar
  16. 16.
    Magnanti, T.L., Wolsey, L.A.: Optimal trees. In: Ball, M.O., et al. (eds.) Handbooks in Operations Research and Management Science, vol. 7, pp. 503–615. Elsevier Science, North-Holland, Amsterdam (1995)Google Scholar
  17. 17.
    Julstrom, B.A., Raidl, G.R.: Edge sets: an effective evolutionary coding of spanning trees. IEEE Transactions on Evolutionary Computation 7(3), 225–239 (2003)CrossRefGoogle Scholar

Copyright information

© Springer Berlin Heidelberg 2007

Authors and Affiliations

  • Sandro Pirkwieser
    • 1
  • Günther R. Raidl
    • 1
  • Jakob Puchinger
    • 2
  1. 1.Institute of Computer Graphics and Algorithms, Vienna University of Technology, ViennaAustria
  2. 2.National ICT Australia (NICTA) Victoria Laboratory, Dep. of Comp. Sci. & Softw. Eng., The University of MelbourneAustralia

Personalised recommendations