Combining Lagrangian decomposition with an evolutionary algorithm for the Knapsack Constrained Maximum Spanning Tree Problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4446 LNCS, Issue , 2007, Pages 176-187

  Pirkwieser, Sandro ^a   Raidl, Günther R ^a   Puchinger, Jakob ^b  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

^b UNIVERSITY OF MELBOURNE   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

EVOLUTIONARY ALGORITHMS; LAGRANGE MULTIPLIERS; PROBLEM SOLVING;

KNAPSACK CONSTRAINED MAXIMUM SPANNING TREE PROBLEM; LAGRANGIAN DECOMPOSITION; LAGRANGIAN RELAXATION BASED METHOD;

TREES (MATHEMATICS);

EID: 38049058766     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-71615-0_16     Document Type: Conference Paper

References (17)

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