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
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
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
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
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
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
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
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
Ivanov, Alexandr; Tuzhilin, Alexey Minimal fillings of finite metric spaces: The state of the art. (English) Zbl 1331.05071 Barg, Alexander (ed.) et al., Discrete geometry and algebraic combinatorics. AMS special session on discrete geometry and algebraic combinatorics, San Diego, CA, USA, January 11, 2013. Providence, RI: American Mathematical Society (AMS) (ISBN 978-1-4704-0905-0/pbk; 978-1-4704-1949-3/ebook). Contemporary Mathematics 625, 9-35 (2014). Reviewer: Hang Lau (Montréal) MSC: 05C12 05C22 05C40 58E15 51K99 90C59 PDF BibTeX XML Cite \textit{A. Ivanov} and \textit{A. Tuzhilin}, Contemp. Math. 625, 9--35 (2014; Zbl 1331.05071) OpenURL
Zavalnyuk, E. A. Local structure of minimal networks in A. D. Alexandrov spaces. (English. Russian original) Zbl 1309.05047 Mosc. Univ. Math. Bull. 69, No. 5, 220-224 (2014); translation from Vestn. Mosk. Univ., Ser I 69, No. 5, 54-58 (2014). MSC: 05C05 05C35 05C82 PDF BibTeX XML Cite \textit{E. A. Zavalnyuk}, Mosc. Univ. Math. Bull. 69, No. 5, 220--224 (2014; Zbl 1309.05047); translation from Vestn. Mosk. Univ., Ser I 69, No. 5, 54--58 (2014) Full Text: DOI OpenURL
Ivanov, A. O.; Melnikova, A. E.; Tuzhilin, A. A. Stabilization of a locally minimal forest. (English. Russian original) Zbl 1298.05292 Sb. Math. 205, No. 3, 387-418 (2014); translation from Mat. Sb. 205, No. 3, 83-118 (2014). MSC: 05C82 05C05 49Q20 PDF BibTeX XML Cite \textit{A. O. Ivanov} et al., Sb. Math. 205, No. 3, 387--418 (2014; Zbl 1298.05292); translation from Mat. Sb. 205, No. 3, 83--118 (2014) Full Text: DOI OpenURL
Thomas, Doreen A.; Weng, Jia F. Euclidean Steiner trees optimal with respect to swapping 4-point subtrees. (English) Zbl 1292.90306 Optim. Lett. 8, No. 4, 1337-1359 (2014). MSC: 90C35 PDF BibTeX XML Cite \textit{D. A. Thomas} and \textit{J. F. Weng}, Optim. Lett. 8, No. 4, 1337--1359 (2014; Zbl 1292.90306) Full Text: DOI OpenURL
Ivanov, Alexander O.; Tuzhilin, Alexey A. Gromov minimal fillings for finite metric spaces. (English) Zbl 1299.51005 Publ. Inst. Math., Nouv. Sér. 94(108), 3-15 (2013). MSC: 51K99 51F99 51E10 05C05 PDF BibTeX XML Cite \textit{A. O. Ivanov} and \textit{A. A. Tuzhilin}, Publ. Inst. Math., Nouv. Sér. 94(108), 3--15 (2013; Zbl 1299.51005) Full Text: DOI OpenURL
Yang, Zong-Xiao; Jia, Xiao-Yao; Hao, Jie-Yu; Gao, Yan-Ping Geometry-experiment algorithm for Steiner minimal tree problem. (English) Zbl 1268.65085 J. Appl. Math. 2013, Article ID 367107, 10 p. (2013). MSC: 65K05 90C27 05C35 90C35 PDF BibTeX XML Cite \textit{Z.-X. Yang} et al., J. Appl. Math. 2013, Article ID 367107, 10 p. (2013; Zbl 1268.65085) Full Text: DOI OpenURL
Thomas, Doreen; Prendergast, Kevin; Weng, Jia Optimum Steiner ratio for gradient-constrained networks connecting three points in 3-space. II: The gradient-constraint \(m\) satisfies \(1 \leq m \leq \sqrt{3}\). (English) Zbl 1221.90031 Networks 57, No. 4, 354-361 (2011). MSC: 90B10 05C90 PDF BibTeX XML Cite \textit{D. Thomas} et al., Networks 57, No. 4, 354--361 (2011; Zbl 1221.90031) Full Text: DOI OpenURL
Dahl, Jonathan Steiner problems in optimal transport. (English) Zbl 1216.49038 Trans. Am. Math. Soc. 363, No. 4, 1805-1819 (2011). MSC: 49Q20 90C35 49J10 93E20 PDF BibTeX XML Cite \textit{J. Dahl}, Trans. Am. Math. Soc. 363, No. 4, 1805--1819 (2011; Zbl 1216.49038) Full Text: DOI OpenURL
Yue, Minyi; Cheng, Congdian A note on the Steiner problem – an approach to find the minimal network with five given points. (English) Zbl 1240.05068 OR Trans. 14, No. 1, 1-14 (2010). MSC: 05C10 05C05 90C35 PDF BibTeX XML Cite \textit{M. Yue} and \textit{C. Cheng}, OR Trans. 14, No. 1, 1--14 (2010; Zbl 1240.05068) OpenURL
Prendergast, K.; Thomas, D. A.; Weng, J. F. Optimum Steiner ratio for gradient-constrained networks connecting three points in 3-space. I. (English) Zbl 1200.90033 Networks 53, No. 2, 212-220 (2009). MSC: 90B10 05C90 PDF BibTeX XML Cite \textit{K. Prendergast} et al., Networks 53, No. 2, 212--220 (2009; Zbl 1200.90033) Full Text: DOI OpenURL
Brazil, M.; Thomas, D. A.; Weng, J. F. Gradient-constrained minimum networks. II: Labelled or locally minimal Steiner points. (English) Zbl 1168.90626 J. Glob. Optim. 42, No. 1, 23-37 (2008). MSC: 90C35 05C05 90B10 PDF BibTeX XML Cite \textit{M. Brazil} et al., J. Glob. Optim. 42, No. 1, 23--37 (2008; Zbl 1168.90626) Full Text: DOI OpenURL
Brazil, Marcus; Thomas, Doreen A.; Weng, Jia Feng Locally minimal uniformly oriented shortest networks. (English) Zbl 1275.90114 Discrete Appl. Math. 154, No. 18, 2545-2564 (2006). MSC: 90C35 68R10 05C05 68M10 68U05 68W35 PDF BibTeX XML Cite \textit{M. Brazil} et al., Discrete Appl. Math. 154, No. 18, 2545--2564 (2006; Zbl 1275.90114) Full Text: DOI OpenURL
Toppur, Badri; Smith, J. MacGregor Properties of \(\mathcal R\)-sausages. (English) Zbl 1060.05052 Discrete Comput. Geom. 31, No. 4, 587-611 (2004). Reviewer: Rolf Schneider (Freiburg i.Br.) MSC: 05C35 05C05 68R10 52B55 90C27 90C35 PDF BibTeX XML Cite \textit{B. Toppur} and \textit{J. M. Smith}, Discrete Comput. Geom. 31, No. 4, 587--611 (2004; Zbl 1060.05052) Full Text: DOI OpenURL
Duin, C. W.; Volgenant, A.; Voß, S. Solving group Steiner problems as Steiner problems. (English) Zbl 1099.90066 Eur. J. Oper. Res. 154, No. 1, 323-329 (2004). MSC: 90C35 05C05 68R10 90C59 PDF BibTeX XML Cite \textit{C. W. Duin} et al., Eur. J. Oper. Res. 154, No. 1, 323--329 (2004; Zbl 1099.90066) Full Text: DOI OpenURL
Gusev, N. S. Convex realizations of planar linear trees. (English. Russian original) Zbl 1051.05030 Math. Notes 73, No. 5, 625-635 (2003); translation from Mat. Zametki 73, No. 5, 665-675 (2003). MSC: 05C05 05C10 68R10 PDF BibTeX XML Cite \textit{N. S. Gusev}, Math. Notes 73, No. 5, 625--635 (2003; Zbl 1051.05030); translation from Mat. Zametki 73, No. 5, 665--675 (2003) Full Text: DOI OpenURL
Cieslik, D.; Dress, A.; Huber, K. T.; Moulton, V. Embedding complexity and discrete optimization. II: A dynamical programming approach to the Steiner-tree problem. (English) Zbl 1024.90053 Ann. Comb. 6, No. 3-4, 275-283 (2002). MSC: 90C27 90C39 68R10 05C05 90C60 90C35 05C35 PDF BibTeX XML Cite \textit{D. Cieslik} et al., Ann. Comb. 6, No. 3--4, 275--283 (2002; Zbl 1024.90053) Full Text: DOI OpenURL
Cieslik, D.; Dress, A.; Fitch, W. Steiner’s problem in double trees. (English) Zbl 1009.05040 Appl. Math. Lett. 15, No. 7, 855-860 (2002). MSC: 05C05 90C35 05C35 PDF BibTeX XML Cite \textit{D. Cieslik} et al., Appl. Math. Lett. 15, No. 7, 855--860 (2002; Zbl 1009.05040) Full Text: DOI OpenURL
Karpunin, G. A. Minimal networks on the regular \(n\)-dimensional simplex. (English. Russian original) Zbl 0987.05061 Math. Notes 69, No. 6, 780-789 (2001); translation from Mat. Zametki 69, No. 6, 854-865 (2001). MSC: 05C35 05C05 PDF BibTeX XML Cite \textit{G. A. Karpunin}, Math. Notes 69, No. 6, 780--789 (2001; Zbl 0987.05061); translation from Mat. Zametki 69, No. 6, 854--865 (2001) Full Text: DOI OpenURL
Ivanov, A. O.; Tuzhilin, A. A. Linear networks and convex polytopes. (English. Russian original) Zbl 0984.05063 J. Math. Sci., New York 104, No. 4, 1283-1288 (2001); translation from Zap. Nauchn. Semin. POMI 252, 52-61 (1998). MSC: 05C62 52B70 PDF BibTeX XML Cite \textit{A. O. Ivanov} and \textit{A. A. Tuzhilin}, J. Math. Sci., New York 104, No. 4, 1283--1288 (2001; Zbl 0984.05063); translation from Zap. Nauchn. Semin. POMI 252, 52--61 (1998) Full Text: DOI OpenURL
Karpunin, G. A. An analogue of Morse theory for planar linear networks and the generalized Steiner problem. (English. Russian original) Zbl 0960.05036 Sb. Math. 191, No. 2, 209-233 (2000); translation from Mat. Sb. 191, No. 2, 64-90 (2000). Reviewer: Dietmar Cieslik (Greifswald) MSC: 05C05 52B70 90B85 58E05 PDF BibTeX XML Cite \textit{G. A. Karpunin}, Sb. Math. 191, No. 2, 64--90 (2000; Zbl 0960.05036); translation from Mat. Sb. 191, No. 2, 64--90 (2000) Full Text: DOI OpenURL
Eiselt, H. A.; Sandblom, C.-L. [Spielberg, K.; Richards, E.; Smith, B. T.; Laporte, G.; Boffey, B. T.] Integer programming and network models. With contributions by K. Spielberg, E. Richards, B. T. Smith, G. Laporte and B. T. Boffey. (English) Zbl 0963.90066 Berlin: Springer. xii, 504 p. (2000). Reviewer: Hubertus Th.Jongen (Aachen) MSC: 90C35 90B10 90-02 90C10 PDF BibTeX XML Cite \textit{H. A. Eiselt} and \textit{C. L. Sandblom}, Integer programming and network models. With contributions by K. Spielberg, E. Richards, B. T. Smith, G. Laporte and B. T. Boffey. Berlin: Springer (2000; Zbl 0963.90066) OpenURL
Trietsch, D.; Weng, J. F. Pseudo-Gilbert-Steiner trees. (English) Zbl 0923.05016 Networks 33, No. 3, 175-178 (1999). MSC: 05C05 90C35 PDF BibTeX XML Cite \textit{D. Trietsch} and \textit{J. F. Weng}, Networks 33, No. 3, 175--178 (1999; Zbl 0923.05016) Full Text: DOI OpenURL
Weng, J. F. Shortest networks on surfaces. (English) Zbl 0928.90097 Du, Ding-Zhu (ed.) et al., Handbook of combinatorial optimization. Vol. 2. Boston: Kluwer Academic Publishers. 589-616 (1998). Reviewer: Patric Östergård (Helsinki) MSC: 90C35 PDF BibTeX XML Cite \textit{J. F. Weng}, in: Handbook of combinatorial optimization. Vol. 2. Boston: Kluwer Academic Publishers. 589--616 (1998; Zbl 0928.90097) OpenURL
Smith, J. MacGregor Steiner minimal trees in \(E^3\): Theory, algorithms, and applications. (English) Zbl 0928.90096 Du, Ding-Zhu (ed.) et al., Handbook of combinatorial optimization. Vol. 2. Boston: Kluwer Academic Publishers. 397-470 (1998). Reviewer: J.Piehler (Merseburg) MSC: 90C35 05C35 92C40 PDF BibTeX XML Cite \textit{J. M. Smith}, in: Handbook of combinatorial optimization. Vol. 2. Boston: Kluwer Academic Publishers. 397--470 (1998; Zbl 0928.90096) OpenURL
Harris, Frederick C. jun. Steiner minimal trees: An introduction, parallel computation, and future work. (English) Zbl 0932.90045 Du, Ding-Zhu (ed.) et al., Handbook of combinatorial optimization. Vol. 2. Boston: Kluwer Academic Publishers. 105-157 (1998). Reviewer: G.Schulz (Magdeburg) MSC: 90C35 05C05 05C35 90C59 PDF BibTeX XML Cite \textit{F. C. Harris jun.}, in: Handbook of combinatorial optimization. Vol. 2. Boston: Kluwer Academic Publishers. 105--157 (1998; Zbl 0932.90045) OpenURL
Ho, Chin-Wen; Hsieh, Sun-Yuan; Chen, Gen-Huey An efficient parallel strategy for computing \(K\)-terminal reliability and finding most vital edges in 2-trees and partial 2-trees. (English) Zbl 0909.68093 J. Parallel Distrib. Comput. 51, No. 2, 89-113 (1998). MSC: 68W15 68M15 PDF BibTeX XML Cite \textit{C.-W. Ho} et al., J. Parallel Distrib. Comput. 51, No. 2, 89--113 (1998; Zbl 0909.68093) Full Text: DOI OpenURL
Warme, David M. A new exact algorithm for rectilinear Steiner trees. (English) Zbl 0903.90175 Pardalos, Panos M. (ed.) et al., Network design: connectivity and facilities location. DIMACS workshop, April 28–30, 1997. Providence, RI: AMS, American Mathematical Society. DIMACS, Ser. Discrete Math. Theor. Comput. Sci. 40, 357-395 (1998). MSC: 90C35 90C10 90C27 90C90 05C05 05C65 90B18 PDF BibTeX XML Cite \textit{D. M. Warme}, DIMACS, Ser. Discrete Math. Theor. Comput. Sci. 40, 357--395 (1998; Zbl 0903.90175) OpenURL
Cieslik, Dietmar Using Hadwiger numbers in network design. (English) Zbl 0915.05044 Pardalos, Panos M. (ed.) et al., Network design: connectivity and facilities location. DIMACS workshop, April 28–30, 1997. Providence, RI: AMS, American Mathematical Society. DIMACS, Ser. Discrete Math. Theor. Comput. Sci. 40, 59-77 (1998). Reviewer: P.Kirschenhofer (Leoben) MSC: 05C05 52A21 90B18 PDF BibTeX XML Cite \textit{D. Cieslik}, DIMACS, Ser. Discrete Math. Theor. Comput. Sci. 40, 59--77 (1998; Zbl 0915.05044) OpenURL
Tuzhilin, A. A. Minimal binary trees with a regular boundary: The case of skeletons with five endpoints. (English. Russian original) Zbl 0941.05018 Math. Notes 61, No. 6, 758-769 (1997); translation from Mat. Zametki 61, No. 6, 907-921 (1997). Reviewer: Lane Clark (Carbondale) MSC: 05C05 PDF BibTeX XML Cite \textit{A. A. Tuzhilin}, Math. Notes 61, No. 6, 758--769 (1997; Zbl 0941.05018); translation from Mat. Zametki 61, No. 6, 907--921 (1997) Full Text: DOI OpenURL
Ivanov, A. O.; Tuzhilin, A. A. The geometry of minimal networks with a given topology and a fixed boundary. (English. Russian original) Zbl 0906.05016 Izv. Math. 61, No. 6, 1231-1263 (1997); translation from Izv. Ross. Akad. Nauk, Ser. Mat. 61, No. 6, 119-152 (1997). MSC: 05C05 68R10 05C35 90C35 PDF BibTeX XML Cite \textit{A. O. Ivanov} and \textit{A. A. Tuzhilin}, Izv. Math. 61, No. 6, 1231--1263 (1997; Zbl 0906.05016); translation from Izv. Ross. Akad. Nauk, Ser. Mat. 61, No. 6, 119--152 (1997) Full Text: DOI OpenURL
Rubinstein, J. H.; Weng, J. F. Compression theorems and Steiner ratios on spheres. (English) Zbl 0895.90173 J. Comb. Optim. 1, No. 1, 67-78 (1997). MSC: 90C35 PDF BibTeX XML Cite \textit{J. H. Rubinstein} and \textit{J. F. Weng}, J. Comb. Optim. 1, No. 1, 67--78 (1997; Zbl 0895.90173) Full Text: DOI OpenURL
Chapeau-Blondeau, François; Janez, Fabrice; Ferrier, Jean-Louis A dynamic adaptive relaxation scheme applied to the Euclidean Steiner minimal tree problem. (English) Zbl 0890.90173 SIAM J. Optim. 7, No. 4, 1037-1053 (1997). MSC: 90C35 05C35 49-04 90C60 90C06 PDF BibTeX XML Cite \textit{F. Chapeau-Blondeau} et al., SIAM J. Optim. 7, No. 4, 1037--1053 (1997; Zbl 0890.90173) Full Text: DOI OpenURL
Cole, T. Non-crossing of plane minimal spanning and minimal T1 networks. (English) Zbl 0892.05016 Discrete Math. 177, No. 1-3, 51-65 (1997). Reviewer: D.Cieslik (Greifswald) MSC: 05C05 PDF BibTeX XML Cite \textit{T. Cole}, Discrete Math. 177, No. 1--3, 51--65 (1997; Zbl 0892.05016) Full Text: DOI OpenURL
Ganley, Joseph L.; Cohoon, James P. Improved computation of optimal rectilinear Steiner minimal trees. (English) Zbl 0887.90172 Int. J. Comput. Geom. Appl. 7, No. 5, 457-472 (1997). MSC: 90C35 90C60 90C39 PDF BibTeX XML Cite \textit{J. L. Ganley} and \textit{J. P. Cohoon}, Int. J. Comput. Geom. Appl. 7, No. 5, 457--472 (1997; Zbl 0887.90172) Full Text: DOI OpenURL
Ivanov, A. O. The geometry of plane locally minimal binary trees. (English. Russian original) Zbl 0862.05024 Sb. Math. 186, No. 9, 1271-1301 (1995); translation from Mat. Sb. 186, No. 9, 45-76 (1995). MSC: 05C05 05C35 05C90 90C35 PDF BibTeX XML Cite \textit{A. O. Ivanov}, Sb. Math. 186, No. 9, 1271--1301 (1995; Zbl 0862.05024); translation from Mat. Sb. 186, No. 9, 45--76 (1995) Full Text: DOI OpenURL
MacGregor Smith, J.; Weiss, Rich; Patel, Minoo An \(O(N^ 2)\) heuristic for Steiner minimal trees in \(E^ 3\). (English) Zbl 0856.90120 Networks 26, No. 4, 273-289 (1995). MSC: 90C35 PDF BibTeX XML Cite \textit{J. MacGregor Smith} et al., Networks 26, No. 4, 273--289 (1995; Zbl 0856.90120) Full Text: DOI OpenURL
Ivanov, A. O.; Tuzhilin, A. A. Weighted minimal binary trees. (English. Russian original) Zbl 0847.05040 Russ. Math. Surv. 50, No. 3, 623-624 (1995); translation from Usp. Mat. Nauk 50, No. 3, 155-156 (1995). MSC: 05C05 68R10 PDF BibTeX XML Cite \textit{A. O. Ivanov} and \textit{A. A. Tuzhilin}, Russ. Math. Surv. 50, No. 3, 623--624 (1995; Zbl 0847.05040); translation from Usp. Mat. Nauk 50, No. 3, 155--156 (1995) Full Text: DOI OpenURL
Salowe, Jeffrey S.; Warme, David M. Thirty-five-point rectilinear Steiner minimal trees in a day. (English) Zbl 0820.90120 Networks 25, No. 2, 69-87 (1995). MSC: 90C35 05C05 PDF BibTeX XML Cite \textit{J. S. Salowe} and \textit{D. M. Warme}, Networks 25, No. 2, 69--87 (1995; Zbl 0820.90120) Full Text: DOI OpenURL
Ivanov, A. O.; Tuzhilin, A. A. Topologies of locally minimal planar binary trees. (English. Russian original) Zbl 0843.90123 Russ. Math. Surv. 49, No. 6, 201-202 (1994); translation from Usp. Mat. Nauk 49, No. 6, 191-192 (1994). MSC: 90C35 05C35 PDF BibTeX XML Cite \textit{A. O. Ivanov} and \textit{A. A. Tuzhilin}, Russ. Math. Surv. 49, No. 6, 201--202 (1994; Zbl 0843.90123); translation from Usp. Mat. Nauk 49, No. 6, 191--192 (1994) Full Text: DOI OpenURL
Dao Trong Thi; Nguyen Huu Quang On length-minimizing Steiner networks. (English) Zbl 0818.90123 Kodai Math. J. 17, No. 3, 488-495 (1994). MSC: 90C35 PDF BibTeX XML Cite \textit{Dao Trong Thi} and \textit{Nguyen Huu Quang}, Kodai Math. J. 17, No. 3, 488--495 (1994; Zbl 0818.90123) Full Text: DOI OpenURL
Ivanov, Alexandr O.; Tuzhilin, Alexei A. Minimal networks: the Steiner problem and its generalizations. (English) Zbl 0842.90116 Boca Raton, FL: CRC Press. xviii, 414 p. (1994). Reviewer: R.Słowinski (Poznań) MSC: 90C35 05C10 68R10 90-01 PDF BibTeX XML Cite \textit{A. O. Ivanov} and \textit{A. A. Tuzhilin}, Minimal networks: the Steiner problem and its generalizations. Boca Raton, FL: CRC Press (1994; Zbl 0842.90116) OpenURL
Cole, T. Some results on greedy algorithm conjectures. (English) Zbl 0819.90118 Discrete Appl. Math. 52, No. 2, 169-194 (1994). MSC: 90C35 05C05 PDF BibTeX XML Cite \textit{T. Cole}, Discrete Appl. Math. 52, No. 2, 169--194 (1994; Zbl 0819.90118) Full Text: DOI OpenURL
Beasley, J. E.; Goffinet, F. A Delaunay triangulation-based heuristic for the Euclidean Steiner problem. (English) Zbl 0807.90115 Networks 24, No. 4, 215-224 (1994). MSC: 90C35 PDF BibTeX XML Cite \textit{J. E. Beasley} and \textit{F. Goffinet}, Networks 24, No. 4, 215--224 (1994; Zbl 0807.90115) Full Text: DOI OpenURL
Kapsalis, A.; Rayward-Smith, V. J.; Smith, G. D. Solving the graphical Steiner tree problem using genetic algorithms. (English) Zbl 0774.90083 J. Oper. Res. Soc. 44, No. 4, 397-406 (1993). MSC: 90C35 68T05 90-08 PDF BibTeX XML Cite \textit{A. Kapsalis} et al., J. Oper. Res. Soc. 44, No. 4, 397--406 (1993; Zbl 0774.90083) Full Text: DOI Link OpenURL
Beasley, J. E. A heuristic for Euclidean and rectilinear Steiner problems. (English) Zbl 0757.90080 Eur. J. Oper. Res. 58, No. 2, 284-292 (1992). MSC: 90C35 90-08 PDF BibTeX XML Cite \textit{J. E. Beasley}, Eur. J. Oper. Res. 58, No. 2, 284--292 (1992; Zbl 0757.90080) Full Text: DOI OpenURL
Ivanov, A. O.; Ptitsina, I. V.; Tuzhilin, A. A. Classification of closed minimal nets on a planar two-dimensional torus. (Russian) Zbl 0815.49028 Lupanov, O. B. (ed.) et al., Selected questions of algebra, geometry and discrete mathematics. Moskva: Moskovskij Gosudarstvennyj Universitet. 47-54 (1992). Reviewer: R.Živaljević (Beograd) MSC: 49Q20 51M25 PDF BibTeX XML Cite \textit{A. O. Ivanov} et al., in: Izbrannye voprosy algebry, geometrii i diskretnoj matematiki. Moskva: Moskovskij Gosudarstvennyj Universitet. 47--54 (1992; Zbl 0815.49028) OpenURL
Ivanov, A. O.; Ptitsyna, I. V.; Tuzhilin, A. A. Classification of closed minimal networks on flat two-dimensional tori. (English. Russian original) Zbl 0818.90125 Russ. Acad. Sci., Sb., Math. 77, No. 2, 391-425 (1994); translation from Mat. Sb. 183, No. 12, 3-44 (1992). Reviewer: D.Cieslik (Greifswald) MSC: 90C35 05C35 05C05 90B06 53B20 PDF BibTeX XML Cite \textit{A. O. Ivanov} et al., Russ. Acad. Sci., Sb., Math. 77, No. 2, 3--44 (1992; Zbl 0818.90125); translation from Mat. Sb. 183, No. 12, 3--44 (1992) Full Text: DOI OpenURL
Ivanov, A. O.; Tuzhilin, A. A. Geometry of minimal networks and the one-dimensional Plateau problem. (English. Russian original) Zbl 0792.90083 Russ. Math. Surv. 47, No. 2, 59-131 (1992); translation from Usp. Mat. Nauk 47, No. 2(284), 53-115 (1992). MSC: 90C35 90-02 05C05 05C12 05C35 PDF BibTeX XML Cite \textit{A. O. Ivanov} and \textit{A. A. Tuzhilin}, Russ. Math. Surv. 47, No. 2, 1 (1992; Zbl 0792.90083); translation from Usp. Mat. Nauk 47, No. 2(284), 53--115 (1992) Full Text: DOI OpenURL
Liu, Zi-Cheng; Du, Ding-Zhu On Steiner minimal trees with \(L_ p\) distance. (English) Zbl 0752.05024 Algorithmica 7, No. 2-3, 179-191 (1992). Reviewer: K.Engel (Rostock) MSC: 05C05 90C35 PDF BibTeX XML Cite \textit{Z.-C. Liu} and \textit{D.-Z. Du}, Algorithmica 7, No. 2--3, 179--191 (1992; Zbl 0752.05024) Full Text: DOI OpenURL
Smith, Warren D. How to find Steiner minimal trees in Euclidean \(d\)-space. (English) Zbl 0751.05028 Algorithmica 7, No. 2-3, 137-177 (1992). Reviewer: K.Engel (Rostock) MSC: 05C05 90C35 05C85 PDF BibTeX XML Cite \textit{W. D. Smith}, Algorithmica 7, No. 2--3, 137--177 (1992; Zbl 0751.05028) Full Text: DOI OpenURL
Mocci, Francesco; Tosi, Mario A direct solution of allocation problems. (English) Zbl 0837.90077 Appl. Math. Modelling 15, No. 7, 374-380 (1991). MSC: 90B80 PDF BibTeX XML Cite \textit{F. Mocci} and \textit{M. Tosi}, Appl. Math. Modelling 15, No. 7, 374--380 (1991; Zbl 0837.90077) Full Text: DOI OpenURL
Tuzhilin, A. A.; Fomenko, A. T. Elements of the geometry and topology of minimal surfaces. (Ѐлементы геометрии и топологии минимальных поверхностей.) (Russian) Zbl 0781.53002 Sovremennaya Matematika dlya Studentov. 2. Moskva: Nauka. 175 p. (1991). Reviewer: Vladimir I. Oliker (Atlanta) MSC: 53-02 53-01 53C42 53A10 49Q05 PDF BibTeX XML Cite \textit{A. A. Tuzhilin} and \textit{A. T. Fomenko}, Ѐлементы геометрии и топологии минимальных поверхностей (Russian). Moskva: Nauka (1991; Zbl 0781.53002) OpenURL
Rubinstein, J. H.; Thomas, D. A. A variational approach to the Steiner network problem. (English) Zbl 0734.05040 Ann. Oper. Res. 33, No. 1-4, 481-499 (1991). MSC: 05C05 90C35 PDF BibTeX XML Cite \textit{J. H. Rubinstein} and \textit{D. A. Thomas}, Ann. Oper. Res. 33, No. 1--4, 481--499 (1991; Zbl 0734.05040) Full Text: DOI OpenURL
Winter, Pawel; MacGregor Smith, J. Steiner minimal trees for three points with one convex polygonal obstacle. (English) Zbl 0748.90073 Ann. Oper. Res. 33, No. 1-4, 577-599 (1991). Reviewer: H.Hamacher (Kaiserslautern) MSC: 90C35 90C60 PDF BibTeX XML Cite \textit{P. Winter} and \textit{J. MacGregor Smith}, Ann. Oper. Res. 33, No. 1--4, 577--599 (1991; Zbl 0748.90073) Full Text: DOI OpenURL
Widmayer, Peter On graphs preserving rectilinear shortest paths in the presence of obstacles. (English) Zbl 0747.90105 Ann. Oper. Res. 33, No. 1-4, 557-575 (1991). Reviewer: Liu Yanpei (Beijing) MSC: 90C35 90C60 05C85 68W35 PDF BibTeX XML Cite \textit{P. Widmayer}, Ann. Oper. Res. 33, No. 1--4, 557--575 (1991; Zbl 0747.90105) Full Text: DOI OpenURL
Cieslik, D. The 1-Steiner-minimal-tree problem in Minkowski-spaces. (English) Zbl 0739.05029 Optimization 22, No. 2, 291-296 (1991). MSC: 05C05 46B20 52A37 90C35 PDF BibTeX XML Cite \textit{D. Cieslik}, Optimization 22, No. 2, 291--296 (1991; Zbl 0739.05029) Full Text: DOI OpenURL
Donno, F.; Pesamosca, G. On the solution of the generalized Steiner problem by the subgradient method. (English) Zbl 0721.90077 Z. Oper. Res. 34, No. 5, 335-352 (1990). Reviewer: G.Merkel (Leipzig) MSC: 90C35 90B80 90-08 PDF BibTeX XML Cite \textit{F. Donno} and \textit{G. Pesamosca}, Z. Oper. Res. 34, No. 5, 335--352 (1990; Zbl 0721.90077) Full Text: DOI OpenURL
Trietsch, Dan Interconnecting networks in the plane: The Steiner case. (English) Zbl 0684.90031 Networks 20, No. 1, 93-108 (1990). MSC: 90B10 90C35 05C05 PDF BibTeX XML Cite \textit{D. Trietsch}, Networks 20, No. 1, 93--108 (1990; Zbl 0684.90031) Full Text: DOI OpenURL
Bern, Marshall W. Two probabilistic results on rectilinear Steiner trees. (English) Zbl 0648.90080 Algorithmica 3, No. 2, 191-204 (1988). Reviewer: H.Hamacher MSC: 90C35 68Q25 65K05 PDF BibTeX XML Cite \textit{M. W. Bern}, Algorithmica 3, No. 2, 191--204 (1988; Zbl 0648.90080) Full Text: DOI OpenURL
Balakrishnan, Anantaram; Patel, Nitin R. Problem reduction methods and a tree generation algorithm for the Steiner network problem. (English) Zbl 0643.90090 Networks 17, No. 1, 65-85 (1987). MSC: 90C35 05C05 90C27 65K05 PDF BibTeX XML Cite \textit{A. Balakrishnan} and \textit{N. R. Patel}, Networks 17, No. 1, 65--85 (1987; Zbl 0643.90090) Full Text: DOI OpenURL
Trietsch, Dan; Handler, Gabriel Y. The Gilbert and Pollak conjecture – a generalization. (English) Zbl 0581.90094 Networks 15, 365-380 (1985). MSC: 90C35 05C35 05C05 PDF BibTeX XML Cite \textit{D. Trietsch} and \textit{G. Y. Handler}, Networks 15, 365--380 (1985; Zbl 0581.90094) Full Text: DOI OpenURL
Aneja, Y. P. An integer linear programming approach to the Steiner problem in graphs. (English) Zbl 0445.90087 Networks 10, 167-178 (1980). MSC: 90C35 90C10 05C05 65K05 PDF BibTeX XML Cite \textit{Y. P. Aneja}, Networks 10, 167--178 (1980; Zbl 0445.90087) Full Text: DOI OpenURL
Chung, F. R. K.; Hwang, F. K. The largest minimal rectilinear Steiner trees for a set of n points enclosed in a rectangle with given perimeter. (English) Zbl 0401.94044 Networks 9, 19-36 (1979). MSC: 94C99 94C15 90C35 PDF BibTeX XML Cite \textit{F. R. K. Chung} and \textit{F. K. Hwang}, Networks 9, 19--36 (1979; Zbl 0401.94044) Full Text: DOI OpenURL