The Steiner tree problem with hop constraints

Annals of Operations Research

Volumn 86, Issue , 1999, Pages 321-345

  Voß, Stefan ^a  

^a TECHNICAL UNIVERSITY OF BRAUNSCHWEIG   (Germany)

Author keywords

Hop constraints; Steiner's problem in graphs; Telecommunication networks

Indexed keywords

EID: 0042715453     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1023/a:1018967121276     Document Type: Article

References (32)

1. Y.P. Aneja, An integer linear programming approach to the Steiner problem in graphs, Networks 10(1980)167-178.
2. A. Balakrishnan and K. Altinkemer, Using a hop-constrained model to generate alternative communication network design, ORSA Journal on Computing 4(1992)192-205.
3. J.E. Beasley, An algorithm for the Steiner problem in graphs, Networks 14(1984) 147-159.
4. J.E. Beasley, OR-Library: Distributing test problems by electronic mail, Journal of the Operational Research Society 41(1990)1069-1072.
5. S. Chopra, E.R. Gorres and M.R. Rao, Solving the Steiner tree problem on a graph using branch and cut, ORSA Journal on Computing 4(1992)320-335.
6. F. Dammeyer and S. Voß, Dynamic tabu list management using the reverse elimination method, Annals of Operations Research 41(1993)31-46.
7. M. Desrochers and G. Laporte, Improvements and extensions to the Miller-Tucker-Zemlin subtour elimination constraints, Operations Research Letters 10(1991)27-36.
8. W. Domschke, A. Scholl and S. Voß, Produktionsplanung, 2nd ed., Springer, Berlin, 1997.
9. C. Duin and S. Voß, Steiner tree heuristics - a survey, in: Operations Research Proceedings, eds. H. Dyckhoff, U. Derigs, M. Salomon and H.C. Tijms, Springer, Berlin, 1994, pp. 485-496.
10. R.E. Erickson, C.L. Monma and A.F. Veinott, Send-and-split methods for minimum-concave-cost network flows, Mathematics of Operations Research 12(1987) 634-664.
11. F. Glover, Tabu search - part II, ORSA Journal on Computing 2(1990)4-32.
12. L. Gouveia, Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with hop constraints, Computers & Operations Research 22(1995)959-970.
13. L. Gouveia, Multicommodity flow models for spanning trees with hop constraints, European Journal of Operational Research 95(1996)178-190.
14. L. Gouveia, Using variable redefinition for computing minimum spanning and Steiner trees with hop constraints, Working Paper, Faculdade de Ciências da Universidade de Lisboa, 1996/97.
15. S.C. Graves and J.B. Orlin, A minimum concave-cost dynamic network flow problem with an application to lot-sizing, Networks 15(1985)59-71.
16. K.S. Hindi, Solving the single-item, capacitated dynamic lot-sizing problem with startup and reservation costs by tabu search, Computers & Industrial Engineering 28(1995)701-707.
17. K.S. Hindi, Solving the CLSP by a tabu search heuristic, Journal of the Operational Research Society 47(1996)151-161.
18. F.K. Hwang, D.S. Richards and P. Winter, The Steiner Tree Problem, North-Holland, Amsterdam, 1992.
19. B.N. Khoury, P.M. Pardalos and D.-Z. Du, A test problem generator for the Steiner problem in graphs, ACM Transactions on Mathematical Software 19(1993)509-522.
20. L.J. Leblanc and R. Reddoch, Reliable link topology/capacity design and routing in backbone telecommunications networks, Working Paper, Vanderbilt University, 1990, presented at 1st ORSA SIG Conf. on Telecommunications.
21. L.J. Leblanc, R. Reddoch, J. Chifflet and P. Mahey, Routing in telecommunications networks with flow restrictions, Working Paper, Vanderbilt University, 1995.
22. R.K. Martin, Generating alternative mixed-integer programming models using variable redefinition, Operations Research 35(1987)820-831.
23. C. Miller, A. Tucker and R. Zemlin, Integer programming formulations and travelling salesman problems, Journal of the Association of Computing Machinery 7(1960)326-329.
24. S. Nahmias, Perishable inventory theory: A review, Operations Research 30(1982)680-708.
25. R.C. Prim, Shortest connection networks and some generalizations, Bell Syst. Techn. J. 36(1957) 1389-1401.
26. F. Raafat, Survey of literature on continuously deteriorating inventory models, Journal of the Operational Research Society 42(1991)27-37.
27. M.G.A. Verhoeven, M.E.M. Severens and E.H.L. Aarts, Local search for Steiner trees in graphs, in: Modern Heuristic Search Methods, eds. V.J. Rayward-Smith, I.H. Osman, C.R. Reeves and G.D. Smith, Wiley, Chichester, 1996, pp. 117-129.
28. S. Voß, Steiner-Probleme in Graphen, Hain, Frankfurt/Main, 1990.
29. S. Voß, Steiner's problem in graphs: Heuristic methods, Discrete Applied Mathematics 40(1992)45-72.
30. S. Voß, Observing logical interdependencies in tabu search: Methods and results, in: Modern Heuristic Search Methods, eds. V.J. Rayward-Smith, I.H. Osman, C.R. Reeves and G.D. Smith, Wiley, Chichester, 1996, pp. 41-59.
31. H.M. Wagner and T.M. Whitin, Dynamic version of the economic lot size model, Management Science 5(1958)89-96.
32. W.I. Zangwill, A backlogging model and a multi-echelon model of a dynamic economic lot size production system - a network approach, Management Science 15(1969)506-527.