Using tabu search to solve the Steiner tree-star problem in telecommunications network design

Telecommunication Systems

Volumn 6, Issue 1, 1996, Pages 117-125

  Xu, Jiefeng ^a   Chiu, Steve Y ^b   Glover, Fred ^a  

^a UNIVERSITY OF COLORADO   (United States)

^b US West Advanced Technologies   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0001028088     PISSN: 10184864     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF02114289     Document Type: Article

References (9)

1. F. Glover, Tabu search - Part I, ORSA J. Comput. 3(1989)190-206.
2. F. Glover, Tabu search fundamentals and uses, Working Paper, Graduate School of Business, University of Colorado at Boulder, Boulder, CO (1995).
3. F. Glover and M. Laguna, Tabu search, in: Moderin Heuristics for Combinatorial Problems, ed. C. Reeves (Blackwell Scientific, 1993).
4. F. Glover and A. Løkketangen, Probabilistic tabu search for zero-one mixed integer programming problems, Working Paper, Graduate School of Business, University of Colorado at Boulder, Boulder, CO (1994).
5. F. Glover, M. Laguna, E. Taillard, D. de Werra (eds.), Ann. Oper. Res. 41 (1993).
6. Y. Lee, L. Lu, Y. Qiu and F. Glover, Strong formulations and cutting planes for designing digital data service networks, Telcom. Syst. 2(1994)261-274.
7. Y. Lee, Y. Chiu and J. Ryan, A branch and cut algorithm for a Steiner tree-star problem, INFORMS J. Comput., to be published.
8. J. Xu, S.Y. Chiu and F. Glover, Probabilistic tabu search for telecommunications network design, J. Combinatorial Optimiz., to be published.
9. J. Xu, S.Y. Chiu and F. Glover, Tabu search heuristics for designing a Steiner tree based digital line network, Working Paper, Graduate School of Business, University of Colorado at Boulder, Boulder, CO (1996).