Using Lagrangian dual information to generate degree constrained spanning trees

Discrete Applied Mathematics

Volumn 154, Issue 5 SPEC. ISS., 2006, Pages 703-717

  Andrade, Rafael ^a   Lucena, Abilio ^b   MacUlan, Nelson ^b  

^a UNIVERSITÉ PARIS 13   (France)

^b FEDERAL UNIVERSITY OF RIO DE JANEIRO   (Brazil)

Author keywords

Heuristic improvement procedure; Infeasibility prevention; Lagrangian heuristic; Restricted problem

Indexed keywords

COMPUTATION THEORY; LAGRANGE MULTIPLIERS; PROBLEM SOLVING; TREES (MATHEMATICS);

INFEASIBILITY PREVENTION; LAGRANGIAN HEURISTIC; RESTRICTED PROBLEM;

HEURISTIC METHODS;

EID: 33644606026     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2005.06.011     Document Type: Article

References (34)

1. R. Ahuja, T.L. Magnanti, and J.B. Orlin Network Flows 1993 Prentice-Hall Englewood Cliffs, NJ
2. R.C. Andrade, Lagrangian heuristics for the DCMST problem, M.Sc. Dissertation, Universidade Federal do Rio de Janeiro, Rio de Janeiro, RJ, Brasil, 1999 (in Portuguese).
3. J.E. Beasley, Lagrangian Relaxation, Personal Notes, Imperial College, London, England, 1992.
4. B. Boldon, N. Deo, N. Kumar, Minimum-weight degree-constrained spanning tree problem: heuristics and implementation on an SIMD parallel machine, Technical Report CS-TR-95-02, Department of Computer Science, University of Central Florida, Orlando, FL, 1995.
5. L. Caccetta, and S.P. Hill A branch and cut method for the degree-constrained minimum spanning tree problem Networks 37 2 2001 74 83
6. T.M. Chan, Euclidean bounded-degree spanning tree ratios, in: Proceedings of the 19th ACM Symposium on Computational Geometry, 2003, pp. 11-19.
7. G. Craig, M. Krishnamoorthy, and M. Palaniswami Comparison of heuristic algorithms for the degree constrained minimum spanning tree I.H. Osman J.P. Kelly Metaheuristics: Theory and Applications 1996 Kluwer Boston
8. J. Edmonds Matroids and the greedy algorithm Math. Programming 1 1971 127 136
9. S.P. Fekete, S. Khuller, M. Klemmstein, B. Raghavachari, and N. Young A network flow technique for finding low-weight bounded-degree trees J. Algorithms 24 1997 310 324
10. M.R. Garey, and D.S. Johnson Computers and Intractability, A Guide to the Theory of NP-Completeness 1979 Freeman San Francisco
11. B. Gavish Topological design of centralized computer networks - formulations and algorithms Networks 12 1982 355 377
12. M.N. Gomes, R.C. Andrade, C.P. Santiago, N. Maculan, Spanning tree algorithms to some hard combinatorial problems, in: Proceedings of Optimization Days 1997, Montreal/Canada, 1997, pp. 83-84.
13. M.H. Held, P. Wolfe, and H.D. Crowder Validation of subgradient optimization Math. Programming 6 1974 62 88
14. S. Khuller, B. Raghavachari, and N. Young Low-degree spanning trees of small weight SIAM J. Comput. 25 2 1996 355 368
15. J. Knowles, Private communication, 2004.
16. J. Knowles, and D. Corne A new evolutionary approach to the degree constrained minimum spanning tree problem IEEE Trans. Evolutionary Comput. 4 2 2000 125 134
17. M. Krishnamoorthy, T.A. Ernst, and Y.M. Sharaiha Comparison of algorithms for the degree constrained minimum spanning tree J. Heuristics 7 2001 587 611
18. J.B. Kruskal Jr. On the shortest spanning subtree of a graph and the traveling salesman problem Proc. Amer. Math. Soc. 7 1956 48 50
19. Y. Li, An effective implementation of a GA using a direct tree representation for constrained minimum spanning tree problems, Technical Report 2000-15, LaRIA, Université de Picardie Jules Verne, France, 2000.
20. A.P. Lucena, and J.E. Beasley Advances in Linear and Integer Programming, Oxford Lecture Series in Mathematics and its Applications 1996 Oxford University Press Oxford
21. C. Monma, and S. Suri Transitions in geometric minimum spanning trees Discrete Comput. Geom. 8 3 1992 265 293
22. S.C. Narula, and C.A. Ho Degree constrained minimum spanning tree Comput. Oper. Res. 7 1980 239 249
23. M. Padberg, and G. Rinaldi A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems SIAM Rev. 33 1991 60 100
24. C.H. Papadimitriou, and U.V. Vazirani On two geometric problems related to the travelling salesman problem J. Algorithms 5 1984 231 246
25. R.C. Prim Shortest connection networks and some generalizations Arch. Math. Phys. 27 1957 742 744
26. G.R. Raidl An efficient evolutionary algorithm for the degree-constrained minimum spanning tree problem Proceedings of the 2000 IEEE Congress on Evolutionary Computation San Diego, CA 2000 104 111
27. G.R. Raidl, and B.A. Julstron A weighted coding in a genetic algorithm for the degree-constrained minimum spanning problem Proceedings of 2000 ACM Symposium on Applied Computing 2000 ACM Press New York 440 445
28. G.R. Raidl, and B.A. Julstron Edge-sets: an effective evolutionary coding of spanning trees IEEE Trans. Evolutionary Comput. 7 3 2003 225 239
29. R. Ravi, M.V. Marathe, S.S. Ravi, D.J. Rosenkrantz, H.B. Hunt, Many birds with one stone: multi-objective approximation algorithms, in: Proceedings of 25th Annual ACM STOCS, 1993, pp. 438-447.
30. R. Ravi, M.V. Marathe, S.S. Ravi, D.J. Rosenkrantz, and H.B. Hunt Approximation algorithms for degree-constrained minimum-cost network-design problems Algorithmica 31 2001 58 78
31. C.C. Ribeiro, and M.C. Souza Variable neighborhood search for the degree-constrained minimum spanning tree problem Discrete Appl. Math. 118 2002 43 54
32. M. Savelsbergh, and T. Volgenant Edge exchanges in the degree-constrained minimum spanning tree problem Comp. Oper. Res. 12 4 1985 341 348
33. A. Volgenant A Lagrangian approach to the DCMST problem European J. Oper. Res. 39 1989 325 331
34. G. Zhou, and M. Gen A note on genetic algorithms for degree constrained spanning tree problems Networks 30 1997 91 95