The regenerator location problem

Networks

Volumn 55, Issue 3, 2010, Pages 205-220

  Chen, Si ^a   Ljubić, Ivana ^b   Raghavan, S ^c  

^a MURRAY STATE UNIVERSITY   (United States)

^b UNIVERSITY OF VIENNA   (Austria)

^c UNIVERSITY OF MARYLAND   (United States)

Author keywords

Branch and cut; Greedy; Heuristics; Maximum leaf spanning tree problem; Optical network design; Steiner arborescence problem

Indexed keywords

BRANCH-AND-CUT; GREEDY HEURISTICS; OPTICAL NETWORK DESIGN; SPANNING TREE PROBLEMS; STEINER ARBORESCENCE;

FIBER OPTIC NETWORKS; HEURISTIC METHODS; LIGHT TRANSMISSION; OPTICAL MATERIALS; OPTIMAL SYSTEMS; OPTIMIZATION; REGENERATORS; TREES (MATHEMATICS);

REFORESTATION;

HEURISTIC METHODS; MATHEMATICS; OPTICAL MATERIALS; OPTIMIZATION; REFORESTATION; TRANSMITTANCE;

EID: 77951210452     PISSN: 00283045     EISSN: 10970037     Source Type: Journal    
DOI: 10.1002/net.20366     Document Type: Conference Paper

References (16)

1. M.S. Borella, J.P. Jue, D. Banerjee, B. Ramamurthy, and B. Mukherjee, Optical components for WDM lightwave networks, Proc IEEE 85 (1997), 1274-1307.
2. M. Chimani, M. Kandyba, I. Ljubíc, and P. Mutzel, Obtaining optimal k-cardinality trees fast, Proceedings of the NinthWorkshop on Algorithm Engineering and Experiments (ALENEX), SIAM (2008), 27-36.
3. M. Fischetti, Facets of two Steiner arborescence polyhedra, Math Prog 51 (1991), 401-419.
4. T. Fujie, An exact algorithm for the maximum leaf spanning tree problem, Comput Oper Res 30 (2003), 1931-1944.
5. T. Fujie, The maximum-leaf spanning tree problem: Formulations and facets, Networks 43 (2004), 212-223.
6. M.R. Garey and D.S. Johnson, Computers and intractability: A guide to the theory of NP-Completeness, Freeman, New York, 1979.
7. M.X. Goemans and Y. Myung, A catalog of Steiner tree formulations, Networks 23 (1993), 19-28.
8. L. Gouveia, P. Patricio, A. Sousa, and R. Valadas, MPLS overWDMnetwork design with packet level QoS constraints based on ILP models, Proc 22nd Annual IEEE Infocom 1 (2003), 576-586.
9. F. Harary, Graph theory, Addison-Wesley, Reading, MA, 1994.
10. I. Ljubíc, R.Weiskircher, U. Pferschy, G.W. Klau, P. Mutzel, and M. Fischetti, An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem, Math Prog 105 (2006), 427-449.
11. B. Mukherjee, WDM optical communication networks: Progress and challenges, IEEE J Selected Areas Commun 18 (2000), 1810-1824.
12. K.Wala and P. Czaderna,Agenetic local search algorithm for weighted maximum leaf spanning tree problem, In Proceedings of the 23rd IFIP TC 7 Conference on System Modelling and Optimization (2007), 394-395.
13. R.E. Tarjan, Depth-first search and linear graph algorithms, SIAM J Comput 1 (1972), 146-160.
14. E. Yetginer and E. Karasan, Regenerator placement and traffic engineering with restoration in GMPLS networks, Photonic Network Commun 6 (2003), 139-149.
15. YouTube, Available at: http://www.youtube.com/t/factsheet, 2006.
16. A. Zymolka, Untersuchung eines Tourenplanungsproblems, Master thesis, Mathematics, Philipps-University Marburg, Germany, 1999.