HEURISTIC METHODS FOR THE RECTILINEAR STEINER ARBORESCENCE PROBLEM
暂无分享,去创建一个
C. W. Duin | Stefan Voss | S. Voß | C. Duin
[1] Ludwig Nastansky,et al. Cost-minimal trees in directed acyclic graphs , 1974, Z. Oper. Research.
[2] A. Volgenant,et al. Reduction tests for the steiner problem in grapsh , 1989, Networks.
[3] Pawel Winter,et al. Steiner problem in networks: A survey , 1987, Networks.
[4] Stefan Voss,et al. Steiner-Probleme in Graphen , 1990 .
[5] V. A. Trubin. Subclass of the Steiner problems on a plane with rectilinear metric , 1985 .
[6] Stefan Voß,et al. Steiner's Problem in Graphs: Heuristic Methods , 1992, Discret. Appl. Math..
[7] Dana S. Richards,et al. Steiner tree problems , 1992, Networks.
[8] Victor J. Rayward-Smith,et al. Steiner problems in graphs: algorithms and applications , 1983 .
[9] Richard T. Wong,et al. A dual ascent approach for steiner tree problems on a directed graph , 1984, Math. Program..
[10] M. Hanan,et al. On Steiner’s Problem with Rectilinear Distance , 1966 .
[11] J. Smith. 5 – Generalized Steiner network problems in engineering design , 1985 .
[12] J. Scott Provan. An Approximation Scheme for Finding Steiner Trees with Obstacles , 1988, SIAM J. Comput..