Dual heuristics on the exact solution of large Steiner problems

Electronic Notes in Discrete Mathematics

Volumn 7, Issue , 2000, Pages 150-153

  Poggi De Aragão, Marcus ^a   Uchoa, Eduardo ^a   Werneck, Renato F ^a  

^a PONTIFICAL CATHOLIC UNIVERSITY OF RIO DE JANEIRO   (Brazil)

Author keywords

Branch and ascent; Branch and cut; Dual ascent; Steiner problem; VLSI layout

Indexed keywords

EID: 52549105351     PISSN: 15710653     EISSN: 15710653     Source Type: Journal    
DOI: 10.1016/s1571-0653(04)00247-1     Document Type: Article

References (7)

1. C. Duin - Steiner's problem in graphs, PhD thesis, Univ. of Amsterdam (1993).
2. T. Koch and A. Martin - Solving Steiner tree problems in graphs to optimality, Networks 32 (1998) 207-232.
3. T. Koch, A. Martin, and S. Voß - SteinLib: An updated library on Steiner tree problems in graphs, ZIB-Report 00-37, Berlin (2000), URL: http://elib.zib.de/steinlib.
4. C. C. Ribeiro, E. Uchoa, and R. F. Werneck - A hybrid GRASP with perturbations and adaptive path-relinking for the Steiner Problem in graphs, Proceedings of the Workshop on Algorithm Engineering as a New Paradigm, Kyoto University (2000).
5. T. Polzin and S. Vahdati - Improved algorithms for the Steiner problem in networks, to appear in Discrete Applied Mathematics.
6. E. Uchoa, M. Poggi de Aragão, and C. C. Ribeiro - Preprocessing Steiner problems from VLSI Layout, Report MCC 32/99 PUC - Rio de Janeiro (1999).
7. R. Wong - A dual ascent approach for Steiner tree problems on a directed graph, Mathematical Programming 28 (1984) 271-287.