Efficient Algorithms for the Prize Collecting Steiner Tree Problems with Interval Data
暂无分享,去创建一个
[1] Dana S. Richards,et al. Steiner tree problems , 1992, Networks.
[2] Guoliang Xue,et al. A PTAS for weight constrained Steiner trees in series-parallel graphs , 2003, Theor. Comput. Sci..
[3] Pascal Van Hentenryck,et al. On the complexity of the robust spanning tree problem with interval data , 2004, Oper. Res. Lett..
[4] Andrzej Pelc,et al. Deterministic Rendezvous in Graphs , 2003 .
[5] Egon Balas,et al. The prize collecting traveling salesman problem , 1989, Networks.
[6] Mauricio G. C. Resende,et al. Strong lower bounds for the prize collecting Steiner problem in graphs , 2004, Discret. Appl. Math..
[7] Richard M. Karp,et al. Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.
[8] Nimrod Megiddo. Combinatorial Optimization with Rational Objective Functions , 1979, Math. Oper. Res..
[9] Charles J. Colbourn,et al. Steiner trees, partial 2-trees, and minimum IFI networks , 1983, Networks.
[10] Carlos Eduardo Ferreira,et al. Primal-dual approximation algorithms for the Prize-Collecting Steiner Tree Problem , 2007, Inf. Process. Lett..
[11] F. Hwang,et al. The Steiner Tree Problem , 2012 .
[12] Xiao-Dong Hu,et al. A polynomial solvable minimum risk spanning tree problem with interval data , 2009, Eur. J. Oper. Res..
[13] Pawel Zielinski,et al. The computational complexity of the relative robust shortest path problem with interval data , 2004, Eur. J. Oper. Res..
[14] Petra Mutzel,et al. The Fractional Prize-Collecting Steiner Tree Problem on Trees: Extended Abstract , 2003, ESA.
[15] Raymond E. Miller,et al. Complexity of Computer Computations , 1972 .
[16] Jie Hu. Minimizing maximum risk for fair network connection with interval data , 2009 .