An Algorithmic Framework for the Exact Solution of the Prize-Collecting Steiner Tree Problem
暂无分享,去创建一个
Matteo Fischetti | Petra Mutzel | Ulrich Pferschy | Ivana Ljubic | René Weiskircher | Gunnar W. Klau | Petra Mutzel | M. Fischetti | Ulrich Pferschy | I. Ljubić | G. Klau | René Weiskircher | U. Pferschy
[1] Abraham P. Punnen,et al. The traveling salesman problem and its variations , 2007 .
[2] Thorsten Koch,et al. Solving Steiner tree problems in graphs to optimality , 1998, Networks.
[3] J. E. Beasley. An SST-based algorithm for the steiner problem in graphs , 1989, Networks.
[4] T. Koch,et al. Solving Steiner Tree Problems in Graphs to Optimality , 1998 .
[5] Peter Värbrand,et al. A strong lower bound for the Node Weighted Steiner Tree Problem , 1998 .
[6] Carlos Eduardo Ferreira,et al. Primal-dual approximation algorithms for the Prize-Collecting Steiner Tree Problem , 2007, Inf. Process. Lett..
[7] M. R. Rao,et al. The Steiner tree problem I: Formulations, compositions and extension of facets , 1994, Math. Program..
[8] Mauricio G. C. Resende,et al. Strong lower bounds for the prize collecting Steiner problem in graphs , 2004, Discret. Appl. Math..
[9] Maria Minkoff. The Prize Collecting Steiner Tree Problem , 2000 .
[10] Petra Mutzel,et al. Combining a Memetic Algorithm with Integer Programming to Solve the Prize-Collecting Steiner Tree Problem , 2004, GECCO.
[11] Celso C. Ribeiro,et al. Local search with perturbations for the prize‐collecting Steiner tree problem in graphs , 2001, Networks.
[12] Richard T. Wong,et al. A dual ascent approach for steiner tree problems on a directed graph , 1984, Math. Program..
[13] Eduardo Uchoa,et al. Reduction tests for the prize-collecting Steiner problem , 2006, Oper. Res. Lett..
[14] Andrew V. Goldberg,et al. On Implementing Push-Relabel Method for the Maximum Flow Problem , 1995, IPCO.
[15] A. Volgenant,et al. Some generalizations of the steiner problem in graphs , 1987, Networks.
[16] David P. Williamson,et al. A note on the prize collecting traveling salesman problem , 1993, Math. Program..
[17] David S. Johnson,et al. The prize collecting Steiner tree problem: theory and practice , 2000, SODA '00.
[18] Matteo Fischetti,et al. Solving the Prize-Collecting Steiner Tree Problem to Optimality , 2005, ALENEX/ANALCO.
[19] Jack J. Dongarra,et al. Performance of various computers using standard linear equations software in a FORTRAN environment , 1988, CARN.
[20] Yash P. Aneja,et al. An integer linear programming approach to the steiner problem in graphs , 1980, Networks.
[21] Michel X. Goemans,et al. The Steiner tree polytope and related polyhedra , 1994, Math. Program..
[22] David P. Williamson,et al. Primal-Dual Approximation Algorithms for Integral Flow and Multicut in Trees, with Applications to Matching and Set Cover , 1993, ICALP.
[23] M. R. Rao,et al. Solving the Steiner Tree Problem on a Graph Using Branch and Cut , 1992, INFORMS J. Comput..
[24] Matteo Fischetti,et al. Facets of two Steiner arborescence polyhedra , 1991, Math. Program..
[25] Arie Segev,et al. The node-weighted steiner tree problem , 1987, Networks.
[26] Herbert Stögner,et al. Simulation and Optimization of the Implementation Costs for the Last Mile of Fiber Optic Networks , 2003 .