A Lagrangean-based decomposition approach for the link constrained Steiner tree problem**
暂无分享,去创建一个
Giovanna Miglionico | Luigi Di Puglia Pugliese | Manlio Gaudioso | Francesca Guerriero | F. Guerriero | M. Gaudioso | L. Pugliese | G. Miglionico
[1] Tobias Polzin,et al. Algorithms for the Steiner problem in networks , 2003 .
[2] Lúcia Maria de A. Drummond,et al. A distributed dual ascent algorithm for the Hop-constrained Steiner Tree Problem , 2010, Oper. Res. Lett..
[3] Cristina Requejo,et al. A 2-path approach for odd-diameter-constrained minimum spanning and Steiner trees , 2004, Networks.
[4] D. Du,et al. Steiner Trees in Industry , 2002 .
[5] Pawel Winter,et al. Steiner problem in networks: A survey , 1987, Networks.
[6] S. Louis Hakimi,et al. Steiner's problem in graphs and its implications , 1971, Networks.
[7] Matteo Fischetti,et al. An Algorithmic Framework for the Exact Solution of the Prize-Collecting Steiner Tree Problem , 2006, Math. Program..
[8] Binhai Zhu,et al. Combinatorial Optimization and Applications , 2014, Lecture Notes in Computer Science.
[9] Renato F. Werneck,et al. Fast Local Search for Steiner Trees in Graphs , 2010, ALENEX.
[10] S. E. Dreyfus,et al. The steiner problem in graphs , 1971, Networks.
[11] S. Voß,et al. The Steiner tree problem with hop constraints , 1999, Ann. Oper. Res..
[12] Vardges Melkonian,et al. New primal-dual algorithms for Steiner tree problems , 2007, Comput. Oper. Res..
[13] Xiaofeng Gao,et al. Combinatorial Optimization and Applications , 2017, Lecture Notes in Computer Science.
[14] Luís Gouveia,et al. Prize collecting Steiner trees with node degree dependent costs , 2011, Comput. Oper. Res..
[15] Giovanna Miglionico,et al. On solving the Lagrangian dual of integer programs via an incremental approach , 2009, Comput. Optim. Appl..
[16] Luís Gouveia,et al. Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs , 2011, Math. Program..
[17] Siavash Vahdati Daneshmand,et al. Improved algorithms for the Steiner problem in networks , 2001, Discret. Appl. Math..
[18] Panos M. Pardalos,et al. Steiner Tree Problems , 2009, Encyclopedia of Optimization.
[19] Stefan Richter,et al. A Faster Algorithm for the Steiner Tree Problem , 2006, STACS.
[20] STACS 2006 , 2006, Lecture Notes in Computer Science.
[21] Giovanna Miglionico,et al. An Algorithm to Find the Link Constrained Steiner Tree in Undirected Graphs , 2016, ICMS.
[22] Mohamed Haouari,et al. An Exact Algorithm for the Steiner Tree Problem with Delays , 2010, Electron. Notes Discret. Math..
[23] Richard M. Karp,et al. Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.
[24] Panos M. Pardalos,et al. A survey of combinatorial optimization problems in multicast routing , 2005, Comput. Oper. Res..
[25] Kyungchul Park,et al. Optimal multicast route packing , 2009, Eur. J. Oper. Res..
[26] Mohamed Haouari,et al. The Steiner Tree Problem with Delays: A compact formulation and reduction procedures , 2014, Discret. Appl. Math..
[27] Siavash Vahdati Daneshmand,et al. Algorithmic approaches to the Steiner problem in networks , 2004 .
[28] Patrick Doherty,et al. Local Search for Hop-Constrained Directed Steiner Tree Problem with Application to UAV-Based Multi-Target Surveillance , 2014, Examining Robustness and Vulnerability of Networked Systems.
[29] Laura Bahiense,et al. Solving Steiner Tree Problems in Graphs with Lagrangian Relaxation , 2003, J. Comb. Optim..
[30] Luís Gouveia,et al. Using Variable Redefinition for Computing Lower Bounds for Minimum Spanning and Steiner Trees with Hop Constraints , 1998, INFORMS J. Comput..
[31] Donghan Kang,et al. A New Mathematical Formulation for Generating a Multicast Routing Tree , 2006 .
[32] David S. Johnson,et al. The Complexity of Computing Steiner Minimal Trees , 1977 .
[33] Markus Sinnl,et al. A New Layered Graph Approach to Hop-and Diameter-constrained Spanning / Steiner Tree Problems in Graphs , 2014 .
[34] Thorsten Koch,et al. SCIP-Jack—a solver for STP and variants with parallelization extensions , 2017, Math. Program. Comput..
[35] Annabella Astorino,et al. Lagrangian relaxation for the directional sensor coverage problem with continuous orientation , 2018 .
[36] Thorsten Koch,et al. Solving Steiner tree problems in graphs to optimality , 1998, Networks.
[37] Luís Gouveia,et al. Network flow models for designing diameter‐constrained minimum‐spanning and Steiner trees , 2003, Networks.
[38] Alysson M. Costa,et al. Fast heuristics for the Steiner tree problem with revenues, budget and hop constraints , 2008, Eur. J. Oper. Res..