Design of a degree-constrained minimal spanning tree with unreliable links and node outage costs

European Journal of Operational Research

Volumn 156, Issue 1, 2004, Pages 73-82

  Kawatra, Rakesh ^a   Bricker, Dennis ^b  

^a MINNESOTA STATE UNIVERSITY   (United States)

^b UNIVERSITY OF IOWA   (United States)

Author keywords

Heuristics; Integer programming; Telecommunications

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; COSTS; DECISION MAKING; DECISION SUPPORT SYSTEMS; HEURISTIC METHODS; INTEGER PROGRAMMING; LAGRANGE MULTIPLIERS; MATHEMATICAL MODELS; OPTIMIZATION; OUTAGES; PROGRAM DOCUMENTATION; TELECOMMUNICATION NETWORKS; TRAVELING SALESMAN PROBLEM;

DEGREE-CONSTRAINED MINIMAL SPANNING TREE (DCMST); HEURISTICS; LAGRANGIAN RELAXATION;

TREES (MATHEMATICS);

EID: 1242276124     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(03)00071-7     Document Type: Conference Paper

References (19)

1. Boldon B., Deo N., Kumar N. Minimum weight degree constrained spanning tree problem: Heuristics and implementation on an SIMD parallel machine. Parallel Computing. 22:1996;369-382.
2. Craig G., Krishnamoorthy M., Palaniswami M. Comparison of heuristic algorithms for the degree constrained minimum spanning tree. Osman I.H., Kelly J.P. Metaheuristics: Theory and Applications. 1996;Kluwer, Boston.
3. G.F. Campbell, J.R. Pimentel, Topological aspects of MAP network design, in: Proceedings of the 11th Conference on Local Computer Networks, 1986, pp. 34-43.
4. Fischetti M., Toth P. An efficient algorithm for the min-sum arborescence problem on complete digraphs. ORSA Journal on Computing. 5:1993;426-434.
5. Fisher M.L. The Lagrangian relaxation method for solving integer programming problems. Management Science. 27:1981;1-18.
6. Gabow H.N. A good algorithm for smallest spanning trees with a degree constraint. Networks. 8:1978;201-208.
7. Garey M.R., Johnson D.S. Computers and Intractability, A Guide to the Theory of NP-Completeness. 1979;Freeman, San Francisco.
8. Gavish B. Topological design of centralized computer networks: Formulations and algorithms. Networks. 12:1982;355-377.
9. Gavish B. Augmented Lagrangian based algorithm for centralized network design. IEEE Transaction on Communications. 33:1985;1247-1257.
10. Held M., Wolfe P., Crowder H.D. Validation of subgradient optimization. Mathematical Programming. 6:1974;62-88.
11. R. Kawatra, A Lagrangian heuristic for the degree constrained minimal spanning tree problem, Working paper, 2001.
12. Kawatra R., Bricker D. A multiperiod planning model for the capacitated minimal spanning tree problem. European Journal of Operational Research. 121:2000;412-419.
13. Larson R., Odoni A. Urban Operations Research. 1981;Prentice-Hall, Englewood Cliffs, NJ.
14. Narula S.C., Ho C.A. Degree constrained minimum spanning tree. Computers and Operations Research. 7:1980;239-249.
15. Pirkul H., Narasimhan S., De P. Locating concentrators for primary and secondary coverage in a computer communications network. IEEE Transactions on Communications. 36:1988;450-457.
16. Savelsbergh M., Volgenant T. Edge exchanges in the degree constrained minimum spanning tree problem. Computers and Operations Research. 12:1985;341-348.
17. Volgenant A. A Lagrangian approach to the degree-constrained minimum spanning tree problem. European Journal of Operational Research. 39:1989;325-331.
18. Yamamoto Y. The Held-Karp algorithm and degree-constrained minimum 1-tree. Mathematical Programming. 15:1978;228-231.
19. Zhou G., Gen M. Approach to the degree-constrained minimum spanning tree problem using genetic algorithms. Engineering Design and Automation. 3:1997;156-165.