The edge-disjoing steiner problem in graphs

References

• Beasley , J.E. 1989 . An SST-Based Algorithm for the Steiner Problem in Graphs . Networks , 19 : 1 – 16 .
   Web of Science ®Google Scholar
• Chopra , S. , Rao , M.R. and Gorres , E.R. 1992 . Solving the Steiner Tree Problem on a graph using branch and cut . ORSA Journal on Compuriny , 4 : 320 – 335 .
   Google Scholar
• Claussen , J. and Hansen , L.A. 1980 . Finding k edge-disjoint spanning trees of total minimal weight in a network: an application of matroid theory . Mathematical programming study , 13 : 88 – 101 .
   Google Scholar
• Duin , C.W. and Volgenant , A. 1989 . Reduction tests for the Steiner Problem in Graphs . Networks , 19 : 549 – 567 .
   Google Scholar
• Duin , C.W. “ Ph.D Thesis, Steiner's Problem in Graphs ” . University of Amsterdam .
   Google Scholar
• Fisher , M.L. 1981 . The Lagrangian relaxation method for solving integer programming problems . Management Science , 27 : 1 – 18 .
   Web of Science ®Google Scholar
• Goffin , J.L. 1977 . On convergence rates of subgradient optimization methods . Mathematical Programming , 13 : 329 – 347 .
   Web of Science ®Google Scholar
• Held , M. , Wolfe , P. and Crowder , H.P. 1974 . Validation of subgradient optimization . Mathematical Programming , 6 : 62 – 88 .
   Google Scholar
• Karp , R.M. 1972 . “ Reducibility among combinatorial problems ” . In Complexity of computer computations , Edited by: Miller , R.E. and Thatcher , J.W. 85 – 103 . New York : Plenum Prress .
   Google Scholar
• Korte , B. , Prömel , H.J. and Steger , A. 1990 . “ Steiner trees in VLSI-layout ” . In Paths, flows and VLSI-layout , Edited by: korte , B. , Lovász , L. , Prömel , H.J. and Schrijver , A. 185 – 214 . New York : Springer-Verlag .
   Google Scholar
• Krarup , J. 1975 . “ The peripatetic salesman and some related unsolved problems ” . In Combinatorial programming: methods and applications , Edited by: roy , B. 173 – 178 . Dordrecht : Reidel Publishing Company .
   Google Scholar
• Lichtenstein , D. 1982 . Planar formulae and their uses . SIAM Journal on Computing , 11 : 329 – 343 .
   Web of Science ®Google Scholar
• Roskind , J.A. and Tarjan , R.E. 1985 . A note on finding minimum–cost edge–disjoint spanning trees . Mathematics of Operations Research , 10 : 701 – 708 .
   Google Scholar