Rehfeldt, Daniel; Koch, Thorsten Implications, conflicts, and reductions for Steiner trees. (English) Zbl 07662921 Math. Program. 197, No. 2 (B), 903-966 (2023). MSC: 90C27 90C10 90C35 PDF BibTeX XML Cite \textit{D. Rehfeldt} and \textit{T. Koch}, Math. Program. 197, No. 2 (B), 903--966 (2023; Zbl 07662921) Full Text: DOI OpenURL
Khachay, M. Yu.; Neznakhina, E. D.; Ryzhenko, K. V. Constant-factor approximation algorithms for a series of combinatorial routing problems based on the reduction to the asymmetric traveling salesman problem. (English. Russian original) Zbl 07661459 Proc. Steklov Inst. Math. 319, Suppl. 1, S140-S155 (2022); translation from Tr. Inst. Mat. Mekh. (Ekaterinburg) 28, No. 3, 241-258 (2022). MSC: 90C27 90C35 90B06 PDF BibTeX XML Cite \textit{M. Yu. Khachay} et al., Proc. Steklov Inst. Math. 319, S140--S155 (2022; Zbl 07661459); translation from Tr. Inst. Mat. Mekh. (Ekaterinburg) 28, No. 3, 241--258 (2022) Full Text: DOI OpenURL
Bose, Prosenjit; D’Angelo, Anthony; Durocher, Stephane On the restricted \(k\)-Steiner tree problem. (English) Zbl 07603298 J. Comb. Optim. 44, No. 4, 2893-2918 (2022). MSC: 90C27 90C35 PDF BibTeX XML Cite \textit{P. Bose} et al., J. Comb. Optim. 44, No. 4, 2893--2918 (2022; Zbl 07603298) Full Text: DOI OpenURL
Li, Jianping; Lichen, Junran; Wang, Wencheng; Yeh, Jean; Yeh, YeongNan; Yu, Xingxing; Zheng, Yujie \(1\)-line minimum rectilinear Steiner trees and related problems. (English) Zbl 07603295 J. Comb. Optim. 44, No. 4, 2832-2852 (2022). MSC: 90C27 90C35 PDF BibTeX XML Cite \textit{J. Li} et al., J. Comb. Optim. 44, No. 4, 2832--2852 (2022; Zbl 07603295) Full Text: DOI OpenURL
Bretin, Elie; Denis, Roland; Masnou, Simon; Terii, Garry Learning phase field mean curvature flows with neural networks. (English) Zbl 07599612 J. Comput. Phys. 470, Article ID 111579, 28 p. (2022). MSC: 65Mxx 35Kxx 49Qxx PDF BibTeX XML Cite \textit{E. Bretin} et al., J. Comput. Phys. 470, Article ID 111579, 28 p. (2022; Zbl 07599612) Full Text: DOI arXiv OpenURL
Sun, Yuefang; Wu, Chenchen; Zhang, Xiaoyan; Zhang, Zhao Computation and algorithm for the minimum \(k\)-edge-connectivity of graphs. (English) Zbl 1502.90155 J. Comb. Optim. 44, No. 3, 1741-1752 (2022). MSC: 90C27 90C35 PDF BibTeX XML Cite \textit{Y. Sun} et al., J. Comb. Optim. 44, No. 3, 1741--1752 (2022; Zbl 1502.90155) Full Text: DOI OpenURL
Zhang, Jiaxuan; Gao, Suogang; Hou, Bo; Liu, Wen An approximation algorithm for the group prize-collecting Steiner tree problem with submodular penalties. (English) Zbl 07575632 Comput. Appl. Math. 41, No. 6, Paper No. 274, 10 p. (2022). MSC: 90C27 90C35 PDF BibTeX XML Cite \textit{J. Zhang} et al., Comput. Appl. Math. 41, No. 6, Paper No. 274, 10 p. (2022; Zbl 07575632) Full Text: DOI OpenURL
Aneesh, D. H.; Mohanapriya, A.; Renjith, P.; Sadagopan, N. Steiner tree in \(k\)-star caterpillar convex bipartite graphs: a dichotomy. (English) Zbl 1497.90209 J. Comb. Optim. 44, No. 2, 1221-1247 (2022). MSC: 90C35 90C27 PDF BibTeX XML Cite \textit{D. H. Aneesh} et al., J. Comb. Optim. 44, No. 2, 1221--1247 (2022; Zbl 1497.90209) Full Text: DOI arXiv OpenURL
Hill, Alessandro; Baldacci, Roberto; Voß, Stefan Optimal Steiner trees under node and edge privacy conflicts. (English) Zbl 1495.90223 J. Comb. Optim. 43, No. 5, 1509-1533 (2022). MSC: 90C35 90C27 90B18 PDF BibTeX XML Cite \textit{A. Hill} et al., J. Comb. Optim. 43, No. 5, 1509--1533 (2022; Zbl 1495.90223) Full Text: DOI OpenURL
Ouzia, Hacene; Maculan, Nelson Mixed integer nonlinear optimization models for the Euclidean Steiner tree problem in \(\mathbb{R}^d\). (English) Zbl 1491.90175 J. Glob. Optim. 83, No. 1, 119-136 (2022). MSC: 90C35 90C11 PDF BibTeX XML Cite \textit{H. Ouzia} and \textit{N. Maculan}, J. Glob. Optim. 83, No. 1, 119--136 (2022; Zbl 1491.90175) Full Text: DOI OpenURL
Fampa, Marcia Insight into the computation of Steiner minimal trees in Euclidean space of general dimension. (English) Zbl 1483.90134 Discrete Appl. Math. 308, 4-19 (2022). MSC: 90C27 90C35 PDF BibTeX XML Cite \textit{M. Fampa}, Discrete Appl. Math. 308, 4--19 (2022; Zbl 1483.90134) Full Text: DOI OpenURL
Jana, Satyabrata; Maheshwari, Anil; Roy, Sasanka Linear-size planar Manhattan network for convex point sets. (English) Zbl 1479.05334 Comput. Geom. 100, Article ID 101819, 19 p. (2022). MSC: 05C82 05C10 05C22 68U05 PDF BibTeX XML Cite \textit{S. Jana} et al., Comput. Geom. 100, Article ID 101819, 19 p. (2022; Zbl 1479.05334) Full Text: DOI arXiv OpenURL
Lei, Lei; Jia, Qi; Zhao, Bing Mean Steiner distance of Vicsek networks. (English) Zbl 1491.05181 Fractals 29, No. 8, Article ID 2150261, 11 p. (2021). MSC: 05C82 28A80 51K05 PDF BibTeX XML Cite \textit{L. Lei} et al., Fractals 29, No. 8, Article ID 2150261, 11 p. (2021; Zbl 1491.05181) Full Text: DOI OpenURL
Stepanova, E. I. Bifurcations of binary types of Steiner minimal networks in the plane. (English. Russian original) Zbl 1479.05335 J. Math. Sci., New York 259, No. 5, 730-747 (2021); translation from Fundam. Prikl. Mat. 22, No. 6, 227-252 (2019). MSC: 05C82 05C10 PDF BibTeX XML Cite \textit{E. I. Stepanova}, J. Math. Sci., New York 259, No. 5, 730--747 (2021; Zbl 1479.05335); translation from Fundam. Prikl. Mat. 22, No. 6, 227--252 (2019) Full Text: DOI OpenURL
Saikia, Parikshit; Karmakar, Sushanta; Pagourtzis, Aris Primal-dual based distributed approximation algorithm for prize-collecting Steiner tree. (English) Zbl 1476.90288 Discrete Math. Algorithms Appl. 13, No. 2, Article ID 2150008, 48 p. (2021). MSC: 90C27 90C35 PDF BibTeX XML Cite \textit{P. Saikia} et al., Discrete Math. Algorithms Appl. 13, No. 2, Article ID 2150008, 48 p. (2021; Zbl 1476.90288) Full Text: DOI arXiv OpenURL
Carioni, Marcello; Pluda, Alessandra On different notions of calibrations for minimal partitions and minimal networks in \(\mathbb{R}^2\). (English) Zbl 1473.51005 Adv. Calc. Var. 14, No. 3, 401-417 (2021). Reviewer: Steven T. Dougherty (Scranton) MSC: 51E10 PDF BibTeX XML Cite \textit{M. Carioni} and \textit{A. Pluda}, Adv. Calc. Var. 14, No. 3, 401--417 (2021; Zbl 1473.51005) Full Text: DOI arXiv OpenURL
Li, Jianping; Zheng, Yujie; Lichen, Junran; Wang, Wencheng On the minimum number of Steiner points of constrained 1-line-fixed Steiner tree in the Euclidean plane \(\mathbb{R}^2\). (English) Zbl 1466.90116 Optim. Lett. 15, No. 2, 669-683 (2021). MSC: 90C35 90C27 PDF BibTeX XML Cite \textit{J. Li} et al., Optim. Lett. 15, No. 2, 669--683 (2021; Zbl 1466.90116) Full Text: DOI OpenURL
Galstyan, A. Kh.; Ivanov, A. O.; Tuzhilin, A. A. The Fermat-Steiner problem in the space of compact subsets of \(\mathbb{R}^m\) endowed with the Hausdorff metric. (English. Russian original) Zbl 1461.51009 Sb. Math. 212, No. 1, 25-56 (2021); translation from Mat. Sb. 212, No. 1, 28-62 (2021). MSC: 51K05 51F99 PDF BibTeX XML Cite \textit{A. Kh. Galstyan} et al., Sb. Math. 212, No. 1, 25--56 (2021; Zbl 1461.51009); translation from Mat. Sb. 212, No. 1, 28--62 (2021) Full Text: DOI OpenURL
Gaul, Daniela; Schmidt, Daniel R. Chvátal-Gomory cuts for the Steiner tree problem. (English) Zbl 1464.05039 Discrete Appl. Math. 291, 188-200 (2021). Reviewer: Xueliang Li (Tianjin) MSC: 05C05 05C82 90B10 90C05 PDF BibTeX XML Cite \textit{D. Gaul} and \textit{D. R. Schmidt}, Discrete Appl. Math. 291, 188--200 (2021; Zbl 1464.05039) Full Text: DOI OpenURL
Gabrel, Virginie; Mahjoub, A. Ridha; Taktak, Raouia; Uchoa, Eduardo The multiple Steiner TSP with order constraints: complexity and optimization algorithms. (English) Zbl 1491.90172 Soft Comput. 24, No. 23, 17957-17968 (2020). MSC: 90C35 90C05 90C10 PDF BibTeX XML Cite \textit{V. Gabrel} et al., Soft Comput. 24, No. 23, 17957--17968 (2020; Zbl 1491.90172) Full Text: DOI Link OpenURL
Maxwell, Alastair; Swanepoel, Konrad J. Shortest directed networks in the plane. (English) Zbl 1458.05093 Graphs Comb. 36, No. 5, 1457-1475 (2020). MSC: 05C20 05C10 05C82 49Q10 52A40 90B10 PDF BibTeX XML Cite \textit{A. Maxwell} and \textit{K. J. Swanepoel}, Graphs Comb. 36, No. 5, 1457--1475 (2020; Zbl 1458.05093) Full Text: DOI arXiv OpenURL
Althaus, Ernst; Rauterberg, Felix; Ziegler, Sarah Computing Euclidean Steiner trees over segments. (English) Zbl 1457.90164 EURO J. Comput. Optim. 8, No. 3-4, 309-325 (2020). MSC: 90C35 PDF BibTeX XML Cite \textit{E. Althaus} et al., EURO J. Comput. Optim. 8, No. 3--4, 309--325 (2020; Zbl 1457.90164) Full Text: DOI OpenURL
Bentz, Cédric; Costa, Marie-Christine; Hertz, Alain On the edge capacitated Steiner tree problem. (English) Zbl 07297232 Discrete Optim. 38, Article ID 100607, 25 p. (2020). MSC: 68R10 05C85 68Q25 90C35 PDF BibTeX XML Cite \textit{C. Bentz} et al., Discrete Optim. 38, Article ID 100607, 25 p. (2020; Zbl 07297232) Full Text: DOI arXiv OpenURL
Bonafini, Mauro; Oudet, Édouard A convex approach to the Gilbert-Steiner problem. (English) Zbl 1448.49019 Interfaces Free Bound. 22, No. 2, 131-155 (2020). Reviewer: Stepan Agop Tersian (Rousse) MSC: 49J45 05C05 PDF BibTeX XML Cite \textit{M. Bonafini} and \textit{É. Oudet}, Interfaces Free Bound. 22, No. 2, 131--155 (2020; Zbl 1448.49019) Full Text: DOI arXiv OpenURL
Bodmann, B. G.; King, E. J. Optimal arrangements of classical and quantum states with limited purity. (English) Zbl 1442.42072 J. Lond. Math. Soc., II. Ser. 101, No. 1, 393-431 (2020). MSC: 42C15 05B05 81P45 52A40 52C17 PDF BibTeX XML Cite \textit{B. G. Bodmann} and \textit{E. J. King}, J. Lond. Math. Soc., II. Ser. 101, No. 1, 393--431 (2020; Zbl 1442.42072) Full Text: DOI arXiv OpenURL
D’Ambrosio, Claudia; Fampa, Marcia; Lee, Jon; Vigerske, Stefan On a nonconvex MINLP formulation of the Euclidean Steiner tree problem in \(n\)-space: missing proofs. (English) Zbl 1442.90135 Optim. Lett. 14, No. 2, 409-415 (2020). MSC: 90C11 90C35 PDF BibTeX XML Cite \textit{C. D'Ambrosio} et al., Optim. Lett. 14, No. 2, 409--415 (2020; Zbl 1442.90135) Full Text: DOI OpenURL
Melo, Alexsander A.; Figueiredo, Celina M. H.; Souza, Uéverton S. A multivariate analysis of the strict terminal connection problem. (English) Zbl 1435.90040 J. Comput. Syst. Sci. 111, 22-41 (2020). MSC: 90B10 90B18 05C82 PDF BibTeX XML Cite \textit{A. A. Melo} et al., J. Comput. Syst. Sci. 111, 22--41 (2020; Zbl 1435.90040) Full Text: DOI OpenURL
Grodet, Aymeric; Tsuchiya, Takuya Reorganizing topologies of Steiner trees to accelerate their eliminations. (English) Zbl 1440.90082 Discrete Math. Algorithms Appl. 12, No. 1, Article ID 2050003, 21 p. (2020). MSC: 90C35 05C05 90C57 PDF BibTeX XML Cite \textit{A. Grodet} and \textit{T. Tsuchiya}, Discrete Math. Algorithms Appl. 12, No. 1, Article ID 2050003, 21 p. (2020; Zbl 1440.90082) Full Text: DOI arXiv OpenURL
Li, Jianping; Liu, Suding; Lichen, Junran; Wang, Wencheng; Zheng, Yujie Approximation algorithms for solving the 1-line Euclidean minimum Steiner tree problem. (English) Zbl 1437.90139 J. Comb. Optim. 39, No. 2, 492-508 (2020). MSC: 90C27 90C35 PDF BibTeX XML Cite \textit{J. Li} et al., J. Comb. Optim. 39, No. 2, 492--508 (2020; Zbl 1437.90139) Full Text: DOI OpenURL
Huang, Lingxiao; Li, Jian; Shi, Qicai Approximation algorithms for the connected sensor cover problem. (English) Zbl 1436.68383 Theor. Comput. Sci. 809, 563-574 (2020). MSC: 68U05 68M18 68W25 PDF BibTeX XML Cite \textit{L. Huang} et al., Theor. Comput. Sci. 809, 563--574 (2020; Zbl 1436.68383) Full Text: DOI arXiv OpenURL
Hill, Alessandro; Baldacci, Roberto; Hoshino, Edna Ayako Capacitated ring arborescence problems with profits. (English) Zbl 1428.90032 OR Spectrum 41, No. 2, 357-389 (2019). MSC: 90B10 90C35 90C27 90B06 90C11 90C59 90C57 PDF BibTeX XML Cite \textit{A. Hill} et al., OR Spectrum 41, No. 2, 357--389 (2019; Zbl 1428.90032) Full Text: DOI OpenURL
Çivril, Ali Approximation of Steiner forest via the bidirected cut relaxation. (English) Zbl 1433.90176 J. Comb. Optim. 38, No. 4, 1196-1212 (2019). MSC: 90C35 68W25 68Q25 PDF BibTeX XML Cite \textit{A. Çivril}, J. Comb. Optim. 38, No. 4, 1196--1212 (2019; Zbl 1433.90176) Full Text: DOI arXiv OpenURL
Ivanova, Marika; Haugland, Dag Integer programming formulations for the shared multicast tree problem. (English) Zbl 1431.90095 J. Comb. Optim. 38, No. 3, 927-956 (2019). MSC: 90C10 90B18 90C35 PDF BibTeX XML Cite \textit{M. Ivanova} and \textit{D. Haugland}, J. Comb. Optim. 38, No. 3, 927--956 (2019; Zbl 1431.90095) Full Text: DOI Link OpenURL
Angelopoulos, Spyros Parameterized analysis of the online priority and node-weighted Steiner tree problems. (English) Zbl 1430.68453 Theory Comput. Syst. 63, No. 6, 1413-1447 (2019). MSC: 68W27 68Q25 68R10 PDF BibTeX XML Cite \textit{S. Angelopoulos}, Theory Comput. Syst. 63, No. 6, 1413--1447 (2019; Zbl 1430.68453) Full Text: DOI HAL OpenURL
Angel, Eric; Nguyen Kim, Thang; Singh, Shikha Approximating \(k\)-forest with resource augmentation: a primal-dual approach. (English) Zbl 1423.68586 Theor. Comput. Sci. 788, 12-20 (2019). MSC: 68W25 90C10 90C35 PDF BibTeX XML Cite \textit{E. Angel} et al., Theor. Comput. Sci. 788, 12--20 (2019; Zbl 1423.68586) Full Text: DOI arXiv OpenURL
Warnow, Tandy (ed.) Bioinformatics and phylogenetics. Seminal contributions of Bernard Moret. (English) Zbl 1429.92003 Computational Biology 29. Cham: Springer (ISBN 978-3-030-10836-6/hbk; 978-3-030-10837-3/ebook). xxv, 410 p. (2019). Reviewer: Irina Ioana Mohorianu (Oxford) MSC: 92-06 00B15 92D15 92C42 90C10 PDF BibTeX XML Cite \textit{T. Warnow} (ed.), Bioinformatics and phylogenetics. Seminal contributions of Bernard Moret. Cham: Springer (2019; Zbl 1429.92003) Full Text: DOI Link OpenURL
Rodríguez-Pereira, Jessica; Fernández, Elena; Laporte, Gilbert; Benavent, Enrique; Martínez-Sykora, Antonio The Steiner traveling salesman problem and its extensions. (English) Zbl 1430.90551 Eur. J. Oper. Res. 278, No. 2, 615-628 (2019). MSC: 90C35 90C10 PDF BibTeX XML Cite \textit{J. Rodríguez-Pereira} et al., Eur. J. Oper. Res. 278, No. 2, 615--628 (2019; Zbl 1430.90551) Full Text: DOI OpenURL
Han, Lu; Xu, Dachuan; Du, Donglei; Wu, Chenchen A 5-approximation algorithm for the \(k\)-prize-collecting Steiner tree problem. (English) Zbl 1422.90062 Optim. Lett. 13, No. 3, 573-585 (2019). MSC: 90C35 PDF BibTeX XML Cite \textit{L. Han} et al., Optim. Lett. 13, No. 3, 573--585 (2019; Zbl 1422.90062) Full Text: DOI OpenURL
Matsuda, Yusa; Takahashi, Satoshi A 4-approximation algorithm for \(k\)-prize collecting Steiner tree problems. (English) Zbl 1420.90078 Optim. Lett. 13, No. 2, 341-348 (2019). MSC: 90C35 90C59 90C27 PDF BibTeX XML Cite \textit{Y. Matsuda} and \textit{S. Takahashi}, Optim. Lett. 13, No. 2, 341--348 (2019; Zbl 1420.90078) Full Text: DOI arXiv OpenURL
Rehfeldt, Daniel; Koch, Thorsten; Maher, Stephen J. Reduction techniques for the prize collecting Steiner tree problem and the maximum-weight connected subgraph problem. (English) Zbl 1409.90048 Networks 73, No. 2, 206-233 (2019). MSC: 90B18 PDF BibTeX XML Cite \textit{D. Rehfeldt} et al., Networks 73, No. 2, 206--233 (2019; Zbl 1409.90048) Full Text: DOI Link OpenURL
Brazil, Marcus; Volz, Marcus; Zachariasen, Martin; Ras, Charl; Thomas, Doreen Computing minimum 2-edge-connected Steiner networks in the Euclidean plane. (English) Zbl 1407.90091 Networks 73, No. 1, 89-103 (2019). MSC: 90B18 PDF BibTeX XML Cite \textit{M. Brazil} et al., Networks 73, No. 1, 89--103 (2019; Zbl 1407.90091) Full Text: DOI OpenURL
Brazil, Marcus; Volz, Marcus; Zachariasen, Martin; Ras, Charl; Thomas, Doreen New pruning rules for the Steiner tree problem and 2-connected Steiner network problem. (English) Zbl 1453.68201 Comput. Geom. 78, 37-49 (2019). MSC: 68U05 68R10 PDF BibTeX XML Cite \textit{M. Brazil} et al., Comput. Geom. 78, 37--49 (2019; Zbl 1453.68201) Full Text: DOI OpenURL
Wang, Xingyin; Golden, Bruce; Wasil, Edward A Steiner zone variable neighborhood search heuristic for the close-enough traveling salesman problem. (English) Zbl 1458.90565 Comput. Oper. Res. 101, 200-219 (2019). MSC: 90C27 90C35 90C59 PDF BibTeX XML Cite \textit{X. Wang} et al., Comput. Oper. Res. 101, 200--219 (2019; Zbl 1458.90565) Full Text: DOI OpenURL
Bilò, Davide New algorithms for Steiner tree reoptimization. (English) Zbl 1499.68398 Chatzigiannakis, Ioannis (ed.) et al., 45th international colloquium on automata, languages, and programming. ICALP 2018, Prague, Czech Republic, July 9–13, 2018. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 107, Article 19, 14 p. (2018). MSC: 68W25 68W40 90C35 90C59 PDF BibTeX XML Cite \textit{D. Bilò}, LIPIcs -- Leibniz Int. Proc. Inform. 107, Article 19, 14 p. (2018; Zbl 1499.68398) Full Text: DOI arXiv OpenURL
Leitner, Markus; Ljubić, Ivana; Luipersbeck, Martin; Sinnl, Markus A dual ascent-based branch-and-bound framework for the prize-collecting Steiner tree and related problems. (English) Zbl 1446.90060 INFORMS J. Comput. 30, No. 2, 402-420 (2018). MSC: 90B18 90C57 PDF BibTeX XML Cite \textit{M. Leitner} et al., INFORMS J. Comput. 30, No. 2, 402--420 (2018; Zbl 1446.90060) Full Text: DOI Link OpenURL
Alex, Jerome The periodic Steiner problem. (English) Zbl 1428.53003 Darmstadt: TU Darmstadt, Fachbereich Mathematik (Diss.). xv, 104 p. (2018). MSC: 53-02 52-02 68-02 90-02 53A10 05Cxx PDF BibTeX XML Cite \textit{J. Alex}, The periodic Steiner problem. Darmstadt: TU Darmstadt, Fachbereich Mathematik (Diss.) (2018; Zbl 1428.53003) Full Text: Link OpenURL
Kirszenblat, D.; Sirinanda, K. G.; Brazil, M.; Grossman, P. A.; Rubinstein, J. H.; Thomas, D. A. Minimal curvature-constrained networks. (English) Zbl 1412.90159 J. Glob. Optim. 72, No. 1, 71-87 (2018). MSC: 90C35 PDF BibTeX XML Cite \textit{D. Kirszenblat} et al., J. Glob. Optim. 72, No. 1, 71--87 (2018; Zbl 1412.90159) Full Text: DOI arXiv OpenURL
Mao, Yaping; Cheng, Eddie; Wang, Zhao Steiner distance in product networks. (English) Zbl 1401.05098 Discrete Math. Theor. Comput. Sci. 20, No. 2, Paper No. 8, 25 p. (2018). MSC: 05C12 05C82 05C05 05C76 05C40 PDF BibTeX XML Cite \textit{Y. Mao} et al., Discrete Math. Theor. Comput. Sci. 20, No. 2, Paper No. 8, 25 p. (2018; Zbl 1401.05098) Full Text: arXiv Link OpenURL
Rehfeldt, Daniel; Koch, Thorsten Transformations for the prize-collecting Steiner tree problem and the maximum-weight connected subgraph problem to sap. (English) Zbl 1413.90228 J. Comput. Math. 36, No. 3, 459-468 (2018). MSC: 90C27 90C35 90C59 PDF BibTeX XML Cite \textit{D. Rehfeldt} and \textit{T. Koch}, J. Comput. Math. 36, No. 3, 459--468 (2018; Zbl 1413.90228) Full Text: DOI Link OpenURL
Cohen, Nachshon; Nutov, Zeev Approximating Steiner trees and forests with minimum number of Steiner points. (English) Zbl 1397.05171 J. Comput. Syst. Sci. 98, 53-64 (2018). MSC: 05C82 05C85 05C05 68W25 PDF BibTeX XML Cite \textit{N. Cohen} and \textit{Z. Nutov}, J. Comput. Syst. Sci. 98, 53--64 (2018; Zbl 1397.05171) Full Text: DOI OpenURL
Buchanan, Austin; Wang, Yiming; Butenko, Sergiy Algorithms for node-weighted Steiner tree and maximum-weight connected subgraph. (English) Zbl 1396.90016 Networks 72, No. 2, 238-248 (2018). MSC: 90B18 90C39 90C35 PDF BibTeX XML Cite \textit{A. Buchanan} et al., Networks 72, No. 2, 238--248 (2018; Zbl 1396.90016) Full Text: DOI OpenURL
Borndörfer, Ralf; Karbstein, Marika An approximation algorithm for the Steiner connectivity problem. (English) Zbl 1396.90015 Networks 72, No. 2, 174-181 (2018). MSC: 90B18 90C59 90B06 PDF BibTeX XML Cite \textit{R. Borndörfer} and \textit{M. Karbstein}, Networks 72, No. 2, 174--181 (2018; Zbl 1396.90015) Full Text: DOI OpenURL
Pansart, Lucie; Catusse, Nicolas; Cambazard, Hadrien Exact algorithms for the order picking problem. (English) Zbl 1458.90126 Comput. Oper. Res. 100, 117-127 (2018). MSC: 90B06 90C10 90C27 90C35 PDF BibTeX XML Cite \textit{L. Pansart} et al., Comput. Oper. Res. 100, 117--127 (2018; Zbl 1458.90126) Full Text: DOI arXiv OpenURL
Feldmann, Andreas Emil; Fung, Wai Shing; Könemann, Jochen; Post, Ian A \((1+\varepsilon)\)-embedding of low highway dimension graphs into bounded treewidth graphs. (English) Zbl 1398.68672 SIAM J. Comput. 47, No. 4, 1667-1704 (2018). MSC: 68W25 68Q25 90B06 90C35 PDF BibTeX XML Cite \textit{A. E. Feldmann} et al., SIAM J. Comput. 47, No. 4, 1667--1704 (2018; Zbl 1398.68672) Full Text: DOI OpenURL
Dau, Hoang; Milenkovic, Olgica MaxMinSum Steiner systems for access balancing in distributed storage. (English) Zbl 1391.05053 SIAM J. Discrete Math. 32, No. 3, 1644-1671 (2018). MSC: 05B05 05B07 94C30 PDF BibTeX XML Cite \textit{H. Dau} and \textit{O. Milenkovic}, SIAM J. Discrete Math. 32, No. 3, 1644--1671 (2018; Zbl 1391.05053) Full Text: DOI arXiv OpenURL
Cambazard, Hadrien; Catusse, Nicolas Fixed-parameter algorithms for rectilinear Steiner tree and rectilinear traveling salesman problem in the plane. (English) Zbl 1403.90567 Eur. J. Oper. Res. 270, No. 2, 419-429 (2018). MSC: 90C27 90C35 PDF BibTeX XML Cite \textit{H. Cambazard} and \textit{N. Catusse}, Eur. J. Oper. Res. 270, No. 2, 419--429 (2018; Zbl 1403.90567) Full Text: DOI arXiv OpenURL
Hill, Alessandro; Schwarze, Silvia Exact algorithms for bi-objective ring tree problems with reliability measures. (English) Zbl 1391.90605 Comput. Oper. Res. 94, 38-51 (2018). MSC: 90C35 90B18 90C29 90B25 PDF BibTeX XML Cite \textit{A. Hill} and \textit{S. Schwarze}, Comput. Oper. Res. 94, 38--51 (2018; Zbl 1391.90605) Full Text: DOI OpenURL
Di Puglia Pugliese, Luigi; Gaudioso, Manlio; Guerriero, Francesca; Miglionico, Giovanna A Lagrangean-based decomposition approach for the link constrained Steiner tree problem. (English) Zbl 1398.90189 Optim. Methods Softw. 33, No. 3, 650-670 (2018). MSC: 90C35 90C59 PDF BibTeX XML Cite \textit{L. Di Puglia Pugliese} et al., Optim. Methods Softw. 33, No. 3, 650--670 (2018; Zbl 1398.90189) Full Text: DOI OpenURL
Leitner, Markus; Ljubić, Ivana; Luipersbeck, Martin; Sinnl, Markus Decomposition methods for the two-stage stochastic Steiner tree problem. (English) Zbl 1401.90249 Comput. Optim. Appl. 69, No. 3, 713-752 (2018). MSC: 90C35 PDF BibTeX XML Cite \textit{M. Leitner} et al., Comput. Optim. Appl. 69, No. 3, 713--752 (2018; Zbl 1401.90249) Full Text: DOI OpenURL
Leitner, Markus; Ljubić, Ivana; Salazar-González, Juan-José; Sinnl, Markus The connected facility location polytope. (English) Zbl 1376.05144 Discrete Appl. Math. 234, 151-167 (2018). MSC: 05C82 05C05 05C90 51D20 PDF BibTeX XML Cite \textit{M. Leitner} et al., Discrete Appl. Math. 234, 151--167 (2018; Zbl 1376.05144) Full Text: DOI Link OpenURL
Könemann, Jochen; Olver, Neil; Pashkovich, Kanstantsin; Ravi, R.; Swamy, Chaitanya; Vygen, Jens On the integrality gap of the prize-collecting Steiner forest LP. (English) Zbl 1467.90082 Jansen, Klaus (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 20th international workshop, APPROX 2017 and 21st international workshop, RANDOM 2017, Berkeley, CA, USA, August 16–18, 2017. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 81, Article 17, 13 p. (2017). MSC: 90C35 68W25 90C59 PDF BibTeX XML Cite \textit{J. Könemann} et al., LIPIcs -- Leibniz Int. Proc. Inform. 81, Article 17, 13 p. (2017; Zbl 1467.90082) Full Text: DOI arXiv OpenURL
Bley, Andreas; Ljubić, Ivana; Maurer, Olaf A node-based ILP formulation for the node-weighted dominating Steiner problem. (English) Zbl 1390.90149 Networks 69, No. 1, 33-51 (2017). MSC: 90B18 90C10 PDF BibTeX XML Cite \textit{A. Bley} et al., Networks 69, No. 1, 33--51 (2017; Zbl 1390.90149) Full Text: DOI OpenURL
de Lima, M. S.; San Felice, M. C.; Lee, O. On generalizations of the parking permit problem and network leasing problems. (English) Zbl 1397.90390 Bassino, Frédérique (ed.) et al., LAGOS 2017. Selected papers of the 9th Latin-American algorithms, graphs, and optimization symposium, Marseille, France, September 11–15, 2017. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 62, 225-230 (2017). MSC: 90C35 90C59 PDF BibTeX XML Cite \textit{M. S. de Lima} et al., Electron. Notes Discrete Math. 62, 225--230 (2017; Zbl 1397.90390) Full Text: DOI OpenURL
Wang, Yiming; Buchanan, Austin; Butenko, Sergiy On imposing connectivity constraints in integer programs. (English) Zbl 1386.90023 Math. Program. 166, No. 1-2 (A), 241-271 (2017). MSC: 90B10 90B18 90C10 90C27 90C35 90C57 68R10 PDF BibTeX XML Cite \textit{Y. Wang} et al., Math. Program. 166, No. 1--2 (A), 241--271 (2017; Zbl 1386.90023) Full Text: DOI OpenURL
Laut, Il’ya L. Correlation between the norm and the geometry of minimal networks. (English. Russian original) Zbl 1372.05210 Sb. Math. 208, No. 5, 684-706 (2017); translation from Mat. Sb. 208, No. 5, 103-128 (2017). MSC: 05C82 05C35 51M16 05C05 52B05 PDF BibTeX XML Cite \textit{I. L. Laut}, Sb. Math. 208, No. 5, 684--706 (2017; Zbl 1372.05210); translation from Mat. Sb. 208, No. 5, 103--128 (2017) Full Text: DOI OpenURL
Ilyutko, Denis P.; Nikonov, Igor M. Extremal networks in \(\lambda\)-geometry, where \(\lambda=3,4,6\). (English. Russian original) Zbl 1368.05137 Sb. Math. 208, No. 4, 479-509 (2017); translation from Mat. Sb. 208, No. 4, 17-50 (2017). MSC: 05C82 05C35 05C05 46B20 90C35 PDF BibTeX XML Cite \textit{D. P. Ilyutko} and \textit{I. M. Nikonov}, Sb. Math. 208, No. 4, 479--509 (2017; Zbl 1368.05137); translation from Mat. Sb. 208, No. 4, 17--50 (2017) Full Text: DOI Link OpenURL
Akhmedov, Murodzhon; LeNail, Alexander; Bertoni, Francesco; Kwee, Ivo; Fraenkel, Ernest; Montemanni, Roberto A fast prize-collecting Steiner forest algorithm for functional analyses in biological networks. (English) Zbl 1491.92057 Salvagnin, Domenico (ed.) et al., Integration of AI and OR techniques in constraint programming. 14th international conference, CPAIOR 2017, Padua, Italy, June 5–8, 2017. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10335, 263-276 (2017). MSC: 92C42 68W99 PDF BibTeX XML Cite \textit{M. Akhmedov} et al., Lect. Notes Comput. Sci. 10335, 263--276 (2017; Zbl 1491.92057) Full Text: DOI Link OpenURL
Roayaei, Mehdy; Razzazi, Mohammadreza Augmenting weighted graphs to establish directed point-to-point connectivity. (English) Zbl 1372.90111 J. Comb. Optim. 33, No. 3, 1030-1056 (2017). MSC: 90C35 PDF BibTeX XML Cite \textit{M. Roayaei} and \textit{M. Razzazi}, J. Comb. Optim. 33, No. 3, 1030--1056 (2017; Zbl 1372.90111) Full Text: DOI OpenURL
Ras, Charl; Swanepoel, Konrad; Thomas, Doreen Anne Approximate Euclidean Steiner trees. (English) Zbl 1362.90354 J. Optim. Theory Appl. 172, No. 3, 845-873 (2017). MSC: 90C35 05C05 90B10 PDF BibTeX XML Cite \textit{C. Ras} et al., J. Optim. Theory Appl. 172, No. 3, 845--873 (2017; Zbl 1362.90354) Full Text: DOI arXiv OpenURL
Xia, Yingjie; Zhu, Mingzhe; Gu, Qianping; Zhang, Luming; Li, Xuelong Toward solving the Steiner travelling salesman problem on urban road maps using the branch decomposition of graphs. (English) Zbl 1428.90147 Inf. Sci. 374, 164-178 (2016). MSC: 90C27 90B06 90C35 PDF BibTeX XML Cite \textit{Y. Xia} et al., Inf. Sci. 374, 164--178 (2016; Zbl 1428.90147) Full Text: DOI OpenURL
Kiefner, Annika Kristina Minimizing path lengths in rectilinear Steiner minimum trees with fixed topology. (English) Zbl 1408.90297 Oper. Res. Lett. 44, No. 6, 835-838 (2016). MSC: 90C35 68R10 05C05 PDF BibTeX XML Cite \textit{A. K. Kiefner}, Oper. Res. Lett. 44, No. 6, 835--838 (2016; Zbl 1408.90297) Full Text: DOI OpenURL
Efrat, Alon; Fekete, Sándor P.; Mitchell, Joseph S. B.; Polishchuk, Valentin; Suomela, Jukka Improved approximation algorithms for relay placement. (English) Zbl 1398.68669 ACM Trans. Algorithms 12, No. 2, Article No. 20, 28 p. (2016). MSC: 68W25 68R10 PDF BibTeX XML Cite \textit{A. Efrat} et al., ACM Trans. Algorithms 12, No. 2, Article No. 20, 28 p. (2016; Zbl 1398.68669) Full Text: DOI arXiv OpenURL
Bagov, M. A.; Kudaev, V. Ch. Steiner network problem in view of energy costs. (Russian. English summary) Zbl 1413.65450 Vestn. KRAUNTS, Fiz.-Mat. Nauki 2016, No. 4(16), 85-92 (2016). MSC: 65N80 05C05 90C35 PDF BibTeX XML Cite \textit{M. A. Bagov} and \textit{V. Ch. Kudaev}, Vestn. KRAUNTS, Fiz.-Mat. Nauki 2016, No. 4(16), 85--92 (2016; Zbl 1413.65450) Full Text: MNR OpenURL
Bagov, M. A. Design problems for the Steiner pipe network. (Russian. English summary) Zbl 1413.65449 Vestn. KRAUNTS, Fiz.-Mat. Nauki 2016, No. 4(16), 80-84 (2016). MSC: 65N80 05C05 90C35 PDF BibTeX XML Cite \textit{M. A. Bagov}, Vestn. KRAUNTS, Fiz.-Mat. Nauki 2016, No. 4(16), 80--84 (2016; Zbl 1413.65449) Full Text: MNR OpenURL
Zhang, Huili; Tong, Weitian; Xu, Yinfeng; Lin, Guohui The Steiner traveling salesman problem with online advanced edge blockages. (English) Zbl 1391.90626 Comput. Oper. Res. 70, 26-38 (2016). MSC: 90C35 90C27 90B06 90C10 68R10 PDF BibTeX XML Cite \textit{H. Zhang} et al., Comput. Oper. Res. 70, 26--38 (2016; Zbl 1391.90626) Full Text: DOI OpenURL
Akhmedov, Murodzhon; Kwee, Ivo; Montemanni, Roberto A divide and conquer matheuristic algorithm for the prize-collecting Steiner tree problem. (English) Zbl 1391.90593 Comput. Oper. Res. 70, 18-25 (2016). MSC: 90C35 90C27 90C59 90C57 PDF BibTeX XML Cite \textit{M. Akhmedov} et al., Comput. Oper. Res. 70, 18--25 (2016; Zbl 1391.90593) Full Text: DOI OpenURL
Liers, Frauke; Martin, Alexander; Pape, Susanne Binary Steiner trees: structural results and an exact solution approach. (English) Zbl 1387.90141 Discrete Optim. 21, 85-117 (2016). MSC: 90C10 90C27 05C05 90C35 90C57 92D15 PDF BibTeX XML Cite \textit{F. Liers} et al., Discrete Optim. 21, 85--117 (2016; Zbl 1387.90141) Full Text: DOI OpenURL
Chen, Yen Hung The bottleneck selected-internal and partial terminal Steiner tree problems. (English) Zbl 1390.90101 Networks 68, No. 4, 331-339 (2016). MSC: 90B10 90C35 PDF BibTeX XML Cite \textit{Y. H. Chen}, Networks 68, No. 4, 331--339 (2016; Zbl 1390.90101) Full Text: DOI OpenURL
Friggstad, Zachary; Könemann, Jochen; Shadravan, Mohammad A logarithmic integrality gap bound for directed Steiner tree in quasi-bipartite graphs. (English) Zbl 1378.68194 Pagh, Rasmus (ed.), 15th Scandinavian symposium and workshops on algorithm theory, SWAT 2016, Reykjavik, Iceland, June 22–24, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-011-8). LIPIcs – Leibniz International Proceedings in Informatics 53, Article 3, 11 p. (2016). MSC: 68W25 05C85 90C35 PDF BibTeX XML Cite \textit{Z. Friggstad} et al., LIPIcs -- Leibniz Int. Proc. Inform. 53, Article 3, 11 p. (2016; Zbl 1378.68194) Full Text: DOI arXiv OpenURL
Ivanova, Marika Shared multicast trees in ad hoc wireless networks. (English) Zbl 1452.90087 Cerulli, Raffaele (ed.) et al., Combinatorial optimization. 4th international symposium, ISCO 2016, Vietri sul Mare, Italy, May 16–18, 2016. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 9849, 273-284 (2016). MSC: 90B18 90C10 90C59 90C05 PDF BibTeX XML Cite \textit{M. Ivanova}, Lect. Notes Comput. Sci. 9849, 273--284 (2016; Zbl 1452.90087) Full Text: DOI OpenURL
Watel, Dimitri; Weisser, Marc-Antoine A practical greedy approximation for the directed Steiner tree problem. (English) Zbl 1356.90151 J. Comb. Optim. 32, No. 4, 1327-1370 (2016). MSC: 90C35 90C59 PDF BibTeX XML Cite \textit{D. Watel} and \textit{M.-A. Weisser}, J. Comb. Optim. 32, No. 4, 1327--1370 (2016; Zbl 1356.90151) Full Text: DOI OpenURL
Watel, Dimitri; Weisser, Marc-Antoine; Bentz, Cédric; Barth, Dominique Directed Steiner trees with diffusion costs. (English) Zbl 1356.90152 J. Comb. Optim. 32, No. 4, 1089-1106 (2016). MSC: 90C35 90C27 90C59 PDF BibTeX XML Cite \textit{D. Watel} et al., J. Comb. Optim. 32, No. 4, 1089--1106 (2016; Zbl 1356.90152) Full Text: DOI OpenURL
Leal do Forte, Vinícius; Tavares Montenegro, Flávio Marcelo; de Moura Brito, José André; Maculan, Nelson Iterated local search algorithms for the Euclidean Steiner tree problem in \(n\) dimensions. (English) Zbl 1348.90601 Int. Trans. Oper. Res. 23, No. 6, 1185-1199 (2016). MSC: 90C35 90C59 PDF BibTeX XML Cite \textit{V. Leal do Forte} et al., Int. Trans. Oper. Res. 23, No. 6, 1185--1199 (2016; Zbl 1348.90601) Full Text: DOI OpenURL
Ivanov, A. O.; Tuzhilin, A. A. Branched coverings and Steiner ratio. (English) Zbl 1348.90597 Int. Trans. Oper. Res. 23, No. 5, 875-882 (2016). MSC: 90C35 PDF BibTeX XML Cite \textit{A. O. Ivanov} and \textit{A. A. Tuzhilin}, Int. Trans. Oper. Res. 23, No. 5, 875--882 (2016; Zbl 1348.90597) Full Text: DOI arXiv OpenURL
Fampa, Marcia; Lee, Jon; Maculan, Nelson An overview of exact algorithms for the Euclidean Steiner tree problem in \(n\)-space. (English) Zbl 1348.90593 Int. Trans. Oper. Res. 23, No. 5, 861-874 (2016). MSC: 90C35 90C11 PDF BibTeX XML Cite \textit{M. Fampa} et al., Int. Trans. Oper. Res. 23, No. 5, 861--874 (2016; Zbl 1348.90593) Full Text: DOI OpenURL
Lai, Xiaofan; Xu, Zhou Improved algorithms for joint optimization of facility locations and network connections. (English) Zbl 1346.90502 Eur. J. Oper. Res. 250, No. 3, 745-753 (2016). MSC: 90B80 90B10 90C35 PDF BibTeX XML Cite \textit{X. Lai} and \textit{Z. Xu}, Eur. J. Oper. Res. 250, No. 3, 745--753 (2016; Zbl 1346.90502) Full Text: DOI OpenURL
Fampa, Marcia; Lee, Jon; Melo, Wendel A specialized branch-and-bound algorithm for the Euclidean Steiner tree problem in \(n\)-space. (English) Zbl 1353.90165 Comput. Optim. Appl. 65, No. 1, 47-71 (2016). MSC: 90C35 90C11 90C57 PDF BibTeX XML Cite \textit{M. Fampa} et al., Comput. Optim. Appl. 65, No. 1, 47--71 (2016; Zbl 1353.90165) Full Text: DOI OpenURL
Li, Jianping; Guan, Li; Ding, Honglin; Li, Weidong Approximations for constructing tree-form structures using specific material with fixed length. (English) Zbl 1353.90169 Optim. Lett. 10, No. 6, 1337-1345 (2016). MSC: 90C35 90C59 PDF BibTeX XML Cite \textit{J. Li} et al., Optim. Lett. 10, No. 6, 1337--1345 (2016; Zbl 1353.90169) Full Text: DOI OpenURL
Sirinanda, K. G.; Brazil, M.; Grossman, P. A.; Rubinstein, J. H.; Thomas, D. A. Gradient-constrained discounted Steiner trees. II: Optimally locating a discounted Steiner point. (English) Zbl 1336.90099 J. Glob. Optim. 64, No. 3, 515-532 (2016). MSC: 90C35 PDF BibTeX XML Cite \textit{K. G. Sirinanda} et al., J. Glob. Optim. 64, No. 3, 515--532 (2016; Zbl 1336.90099) Full Text: DOI OpenURL
Sirinanda, K. G.; Brazil, M.; Grossman, P. A.; Rubinstein, J. H.; Thomas, D. A. Gradient-constrained discounted Steiner trees. I: Optimal tree configurations. (English) Zbl 1346.90792 J. Glob. Optim. 64, No. 3, 497-513 (2016). MSC: 90C35 PDF BibTeX XML Cite \textit{K. G. Sirinanda} et al., J. Glob. Optim. 64, No. 3, 497--513 (2016; Zbl 1346.90792) Full Text: DOI OpenURL
Kirzhner, Valery; Volkovich, Z.; Ravve, Elena; Weber, G.-W. An estimate of the objective function optimum for the network Steiner problem. (English) Zbl 1334.90188 Ann. Oper. Res. 238, No. 1-2, 315-328 (2016). MSC: 90C35 PDF BibTeX XML Cite \textit{V. Kirzhner} et al., Ann. Oper. Res. 238, No. 1--2, 315--328 (2016; Zbl 1334.90188) Full Text: DOI OpenURL
Calinescu, Gruia; Grimmer, Benjamin; Misra, Satyajayant; Tongngam, Sutep; Xue, Guoliang; Zhang, Weiyi Improved approximation algorithms for single-tiered relay placement. (English) Zbl 1343.90019 J. Comb. Optim. 31, No. 3, 1280-1297 (2016). MSC: 90B18 90C59 PDF BibTeX XML Cite \textit{G. Calinescu} et al., J. Comb. Optim. 31, No. 3, 1280--1297 (2016; Zbl 1343.90019) Full Text: DOI OpenURL
Hajiaghayi, MohammadTaghi; Khandekar, Rohit; Kortsarz, Guy; Nutov, Zeev On fixed cost \(k\)-flow problems. (English) Zbl 1332.90048 Theory Comput. Syst. 58, No. 1, 4-18 (2016). MSC: 90B10 05C21 68Q25 68W25 90C35 PDF BibTeX XML Cite \textit{M. Hajiaghayi} et al., Theory Comput. Syst. 58, No. 1, 4--18 (2016; Zbl 1332.90048) Full Text: DOI OpenURL
Brazil, M.; Ras, C. J.; Thomas, D. A. An exact algorithm for the bottleneck 2-connected \(k\)-Steiner network problem in \(L_p\) planes. (English) Zbl 1329.05268 Discrete Appl. Math. 201, 47-69 (2016). MSC: 05C82 68R10 68M10 68U05 PDF BibTeX XML Cite \textit{M. Brazil} et al., Discrete Appl. Math. 201, 47--69 (2016; Zbl 1329.05268) Full Text: DOI arXiv OpenURL
Abdi, Ahmad; Feldmann, Andreas Emil; Guenin, Bertrand; Könemann, Jochen; Sanità, Laura Lehman’s theorem and the directed Steiner tree problem. (English) Zbl 1336.90107 SIAM J. Discrete Math. 30, No. 1, 141-153 (2016). MSC: 90C57 90C35 PDF BibTeX XML Cite \textit{A. Abdi} et al., SIAM J. Discrete Math. 30, No. 1, 141--153 (2016; Zbl 1336.90107) Full Text: DOI OpenURL
Gu, Albert; Gupta, Anupam; Kumar, Amit The power of deferral: maintaining a constant-competitive Steiner tree online. (English) Zbl 1333.68301 SIAM J. Comput. 45, No. 1, 1-28 (2016). MSC: 68W27 05C05 90C35 PDF BibTeX XML Cite \textit{A. Gu} et al., SIAM J. Comput. 45, No. 1, 1--28 (2016; Zbl 1333.68301) Full Text: DOI arXiv OpenURL
Song, Yongjia; Zhang, Minjiao Chance-constrained multi-terminal network design problems. (English) Zbl 1411.90344 Nav. Res. Logist. 62, No. 4, 321-334 (2015). MSC: 90C35 05C85 65K05 90C11 PDF BibTeX XML Cite \textit{Y. Song} and \textit{M. Zhang}, Nav. Res. Logist. 62, No. 4, 321--334 (2015; Zbl 1411.90344) Full Text: DOI OpenURL
Huang, Zhenhua; Zhang, Jiawen; Zhang, Bo Information recommendation between user groups in social networks. (English) Zbl 1390.90602 Arab. J. Sci. Eng. 40, No. 5, 1443-1453 (2015). MSC: 90C60 90C35 91D30 94A15 PDF BibTeX XML Cite \textit{Z. Huang} et al., Arab. J. Sci. Eng. 40, No. 5, 1443--1453 (2015; Zbl 1390.90602) Full Text: DOI OpenURL
Jelić, Slobodan An FPTAS for the fractional group Steiner tree problem. (English) Zbl 1357.90168 Croat. Oper. Res. Rev. (CRORR) 6, No. 2, 525-539 (2015). MSC: 90C35 90C27 90C59 PDF BibTeX XML Cite \textit{S. Jelić}, Croat. Oper. Res. Rev. (CRORR) 6, No. 2, 525--539 (2015; Zbl 1357.90168) Full Text: DOI OpenURL
Abe, Fabio Henrique N.; Hoshino, Edna A.; Hill, Alessandro The ring tree facility location problem. (English) Zbl 1347.05230 Campêlo, Manoel (ed.) et al., LAGOS ’15. Selected papers of the 8th Latin-American algorithms, graphs, and optimization symposium, Praia das Fontes, Beberibe, Brazil, May 11–15, 2015. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 50, 331-336, electronic only (2015). MSC: 05C82 05C05 05C90 90C10 90B06 90B10 PDF BibTeX XML Cite \textit{F. H. N. Abe} et al., Electron. Notes Discrete Math. 50, 331--336 (2015; Zbl 1347.05230) Full Text: DOI OpenURL