{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,13]],"date-time":"2025-12-13T18:06:07Z","timestamp":1765649167733,"version":"3.48.0"},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T00:00:00Z","timestamp":1760659200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T00:00:00Z","timestamp":1760659200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["4OR-Q J Oper Res"],"published-print":{"date-parts":[[2025,12]]},"DOI":"10.1007\/s10288-025-00604-z","type":"journal-article","created":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T17:03:50Z","timestamp":1760720630000},"page":"353-382","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Mathematical Optimization Models for the Euclidean Steiner Tree Problem in $$\\mathbb {R}^d$$"],"prefix":"10.1007","volume":"23","author":[{"given":"Nelson","family":"Maculan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3897-3356","authenticated-orcid":false,"given":"Marcia","family":"Fampa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3707-6741","authenticated-orcid":false,"given":"Hac\u00e8ne","family":"Ouzia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Renan","family":"Pinto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,10,17]]},"reference":[{"issue":"1","key":"604_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s12532-008-0001-1","volume":"1","author":"T Achterberg","year":"2009","unstructured":"Achterberg T (2009) Scip: solving constraint integer programs. Math Program Comput 1(1):1\u201341","journal-title":"Math Program Comput"},{"key":"604_CR2","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/BF01425476","volume":"34","author":"WK Allard","year":"1976","unstructured":"Allard WK, Almgren FJ (1976) The structure of stationary one dimensional varifolds with positive density. Invent Math 34:83\u201397","journal-title":"Invent Math"},{"key":"604_CR3","doi-asserted-by":"crossref","unstructured":"Bauschke HH, Combettes PL (2017) Convex Analysis and Monotone Operator Theory in Hilbert Spaces, 2nd edn. CMS Books in Mathematics, Springer, 10.1007\/978-3-319-48311-5","DOI":"10.1007\/978-3-319-48311-5"},{"key":"604_CR4","doi-asserted-by":"crossref","unstructured":"Belotti P, Berthold T, Neves K (2016) Algorithms for discrete nonlinear optimization in FICO Xpress. In: 2016 IEEE Sensor Array and Multichannel Signal Processing Workshop (SAM), pp 1\u20135","DOI":"10.1109\/SAM.2016.7569658"},{"key":"604_CR5","unstructured":"de\u00a0Berg M, Cheong O, van Kreveld M, et\u00a0al (2021) Computational Geometry: Algorithms and Applications, 4th edn. Springer, 10.1007\/978-3-030-61520-2"},{"issue":"4","key":"604_CR6","doi-asserted-by":"publisher","first-page":"706","DOI":"10.1137\/0209055","volume":"9","author":"T Beyer","year":"1980","unstructured":"Beyer T, Hedetniemi SM (1980) Constant time generation of rooted trees. SIAM J Comput 9(4):706\u2013712","journal-title":"SIAM J Comput"},{"key":"604_CR7","doi-asserted-by":"crossref","unstructured":"Brazil M, Zachariasen M (2015) Optimal Interconnection Trees in the Plane: Theory, Algorithms and Applications, Algorithms and Combinatorics, vol\u00a029. Springer, Cham (Springer International Publishing), 10.1007\/978-3-319-13915-9","DOI":"10.1007\/978-3-319-13915-9"},{"issue":"2","key":"604_CR8","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1002\/net.20279","volume":"53","author":"M Brazil","year":"2009","unstructured":"Brazil M, Thomas DA, Nielsen BK et al (2009) A novel approach to phylogenetic trees: $$d$$-dimensional geometric steiner trees. Networks 53(2):104\u2013111","journal-title":"Networks"},{"key":"604_CR9","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/s00407-013-0127-z","volume":"68","author":"M Brazil","year":"2014","unstructured":"Brazil M, Graham RL, Thomas DA et al (2014) On the history of the euclidean steiner tree problem. Arch Hist Exact Sci 68:327\u2013354","journal-title":"Arch Hist Exact Sci"},{"issue":"3","key":"604_CR10","doi-asserted-by":"publisher","first-page":"550","DOI":"10.1111\/j.1558-5646.1967.tb03411.x","volume":"21","author":"LL Cavalli-Sforza","year":"1967","unstructured":"Cavalli-Sforza LL, Edwards AWF (1967) Phylogenetic analysis: models and estimation procedures. Evolution 21(3):550\u2013570","journal-title":"Evolution"},{"key":"604_CR11","unstructured":"Cieslik D (2004) Shortest connectivity \u2013 introduction with applications in phylogeny. In: Combinatorial Optimization, vol\u00a017. Springer, New York"},{"key":"604_CR12","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/978-3-319-20086-6_10","volume-title":"Experimental Algorithms","author":"C D\u2019Ambrosio","year":"2015","unstructured":"D\u2019Ambrosio C, Fampa M, Lee J et al (2015) On a nonconvex minlp formulation of the euclidean steiner tree problem in n-space. In: Bampis E (ed) Experimental Algorithms. Springer International Publishing, Cham, pp 122\u2013133"},{"key":"604_CR13","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/s11590-018-1295-1","volume":"14","author":"C D\u2019Ambrosio","year":"2020","unstructured":"D\u2019Ambrosio C, Fampa M, Lee J et al (2020) On a nonconvex minlp formulation of the euclidean steiner tree problem in n-space: missing proofs. Optimization Letters 14:409\u2013415","journal-title":"Optimization Letters"},{"issue":"4","key":"604_CR14","first-page":"4","volume":"308","author":"M Fampa","year":"2019","unstructured":"Fampa M (2019) Insight into the computation of steiner minimal trees in euclidean space of general dimension. Discret Appl Math 308(4):4\u201319","journal-title":"Discret Appl Math"},{"issue":"2","key":"604_CR15","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1016\/j.disopt.2007.08.006","volume":"5","author":"M Fampa","year":"2008","unstructured":"Fampa M, Anstreicher KM (2008) An improved algorithm for computing steiner minimal trees in euclidean d-space. Discret Optim 5(2):530\u2013540","journal-title":"Discret Optim"},{"issue":"4","key":"604_CR16","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1051\/ro:2001120","volume":"35","author":"M Fampa","year":"2001","unstructured":"Fampa M, Maculan N (2001) A new relaxation in conic form for the euclidean steiner problem in $$\\mathbb{r} ^n$$. RAIRO-Operations Research 35(4):283\u2013394","journal-title":"RAIRO-Operations Research"},{"issue":"4","key":"604_CR17","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1023\/B:NUMA.0000021765.17831.bc","volume":"35","author":"M Fampa","year":"2004","unstructured":"Fampa M, Maculan N (2004) Using a conic formulation for finding steiner minimal trees. Numerical Algorithms 35(4):315\u2013330","journal-title":"Numerical Algorithms"},{"issue":"4","key":"604_CR18","doi-asserted-by":"publisher","first-page":"861","DOI":"10.1111\/itor.12207","volume":"23","author":"M Fampa","year":"2016","unstructured":"Fampa M, Lee J, Maculan N (2016) An overview of exact algorithms for the euclidean steiner tree problem in $$n$$-space. Int Trans Oper Res 23(4):861\u2013874","journal-title":"Int Trans Oper Res"},{"key":"604_CR19","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/s10589-016-9835-z","volume":"65","author":"M Fampa","year":"2016","unstructured":"Fampa M, Lee J, Melo W (2016) A specialized branch-and-bound algorithm for the euclidean steiner tree problem in $$n$$-pace. Comput Optim Appl 65:47\u201371","journal-title":"Comput Optim Appl"},{"key":"604_CR20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-62010-2","author":"H Federer","year":"1969","unstructured":"Federer H (1969) Geometric measure theory, die grundlehren der mathematischen wissenschaften, vol 153. Springer Berlin Heidelberg. https:\/\/doi.org\/10.1007\/978-3-642-62010-2","journal-title":"Springer Berlin Heidelberg"},{"issue":"3","key":"604_CR21","doi-asserted-by":"publisher","first-page":"458","DOI":"10.2307\/1970227","volume":"72","author":"H Federer","year":"1960","unstructured":"Federer H, Fleming WH (1960) Normal and integral currents. Ann Math 72(3):458\u2013520","journal-title":"Ann Math"},{"key":"604_CR22","unstructured":"Fonseca R, Brazil M, Winter P, et\u00a0al (2014) Faster exact algorithms for computing Steiner trees in higher dimensional Euclidean spaces. In: Proceedings of the $$11$$th DIMACS Implementation Challenge Workshop, Providence, United States, conference date: 04-12-2014 Through 05-12-2014"},{"key":"604_CR23","volume-title":"Computers and Intractability: A guide to the theory of NP-Completeness","author":"M Garey","year":"1979","unstructured":"Garey M, Johnson D (1979) Computers and Intractability: A guide to the theory of NP-Completeness. USA, W.H, Freeman and Company, San Francisco, CA"},{"issue":"4","key":"604_CR24","doi-asserted-by":"publisher","first-page":"835","DOI":"10.1137\/0132072","volume":"32","author":"M Garey","year":"1977","unstructured":"Garey M, Graham R, Johnson DS (1977) The complexity of computing steiner minimal trees. J SIAM Appl Math 32(4):835\u2013859","journal-title":"J SIAM Appl Math"},{"issue":"1","key":"604_CR25","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/0116001","volume":"16","author":"EN Gilbert","year":"1968","unstructured":"Gilbert EN, Pollak HO (1968) Steiner minimal trees. SIAM J Appl Math 16(1):1\u201329","journal-title":"SIAM J Appl Math"},{"key":"604_CR26","volume-title":"The Steiner tree problem","author":"F Hwang","year":"1992","unstructured":"Hwang F, Richards D, Winter W (1992) The Steiner tree problem, vol 53. Annals of Discrete Math, Elsevier, Amsterdam"},{"key":"604_CR27","doi-asserted-by":"publisher","first-page":"520","DOI":"10.1016\/j.comgeo.2011.11.007","volume":"46","author":"JWV Laarhoven","year":"2013","unstructured":"Laarhoven JWV, Anstreicher KM (2013) Geometric conditions for euclidean steiner trees in $$\\mathbb{r} ^d$$. Comput Geom 46:520\u2013531","journal-title":"Comput Geom"},{"key":"604_CR28","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1023\/A:1018903619285","volume":"96","author":"N Maculan","year":"2000","unstructured":"Maculan N, Michelon P, Xavier AE (2000) The euclidean steiner tree problem in $$\\mathbb{r} ^n:$$ a mathematical programming formulation. Ann Oper Res 96:209\u2013220","journal-title":"Ann Oper Res"},{"key":"604_CR29","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/BF01580665","volume":"10","author":"GP McCormick","year":"1976","unstructured":"McCormick GP (1976) Computability of global solutions to factorable nonconvex programs: part i - convex underestimating problems. Math Program 10:147\u2013175","journal-title":"Math Program"},{"issue":"1\u20132","key":"604_CR30","first-page":"217","volume":"286","author":"W Melo","year":"2018","unstructured":"Melo W, Fampa M, Raupp F (2018) An overview of minlp algorithms and their implementation in muriqui optimizer. Ann Oper Res 286(1\u20132):217\u2013241","journal-title":"Ann Oper Res"},{"issue":"2","key":"604_CR31","doi-asserted-by":"publisher","first-page":"143","DOI":"10.4153\/CMB-1961-016-2","volume":"4","author":"ZA Melzak","year":"1961","unstructured":"Melzak ZA (1961) On the problem of steiner. Can Math Bull 4(2):143\u2013148","journal-title":"Can Math Bull"},{"key":"604_CR32","doi-asserted-by":"publisher","first-page":"056702-1","DOI":"10.1103\/PhysRevE.68.056702","volume":"68","author":"F Montenegro","year":"2003","unstructured":"Montenegro F, Torre\u00e3o JRA, Maculan N (2003) Microcanonical optimization for the euclidean steiner problem in $$\\mathbb{r} ^n$$ with application to phylogenetic inference. Phys Rev E 68:056702-1\u2013056702-5","journal-title":"Phys Rev E"},{"key":"604_CR33","volume-title":"Geometric Measure Theory: A Beginner\u2019s Guide","author":"F Morgan","year":"2016","unstructured":"Morgan F (2016) Geometric Measure Theory: A Beginner\u2019s Guide, 5th edn. Elsevier\/Academic Press, Amsterdam","edition":"5"},{"key":"604_CR34","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/s10898-021-01001-6","volume":"83","author":"H Ouzia","year":"2022","unstructured":"Ouzia H, Maculan N (2022) Mixed integer nonlinear optimization models for the euclidean steiner tree problem in r$$^d$$. J Global Optim 83:119\u2013136","journal-title":"J Global Optim"},{"issue":"6","key":"604_CR35","doi-asserted-by":"publisher","first-page":"3886","DOI":"10.1111\/itor.13265","volume":"30","author":"RV Pinto","year":"2023","unstructured":"Pinto RV, Ouzia H, Maculan N (2023) A new second-order conic optimization model for the euclidean steiner tree problem in $$\\mathbb{r} ^d$$. Int Trans Oper Res 30(6):3886\u20133903","journal-title":"Int Trans Oper Res"},{"issue":"1","key":"604_CR36","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/S0895480192241190","volume":"10","author":"J Rubinstein","year":"1997","unstructured":"Rubinstein J, Thomas D, Wormald N (1997) Steiner trees for terminals constrained to curves. SIAM J Discret Math 10(1):1\u201317","journal-title":"SIAM J Discret Math"},{"key":"604_CR37","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/BF00138693","volume":"8","author":"NV Sahinidis","year":"1996","unstructured":"Sahinidis NV (1996) Baron: a general purpose global optimization software package. J Global Optim 8:201\u2013205","journal-title":"J Global Optim"},{"key":"604_CR38","unstructured":"Simon L (1983) Lectures on Geometric Measure Theory, Proceedings of the Centre for Mathematical Analysis, vol\u00a03. Australian National University"},{"key":"604_CR39","doi-asserted-by":"crossref","unstructured":"Smith JM, Jang Y, Kim MK (2007) Steiner minimal trees, twist angles, and the protein folding problem. Proteins: Structures, Functions, and Bioinformatics 66(4):889\u2013902","DOI":"10.1002\/prot.21257"},{"issue":"2\u20133","key":"604_CR40","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/BF01758756","volume":"7","author":"WD Smith","year":"1992","unstructured":"Smith WD (1992) How to find steiner minimal trees in euclidean $$d$$-space. Algorithmica 7(2\u20133):137\u2013177","journal-title":"Algorithmica"},{"key":"604_CR41","doi-asserted-by":"publisher","first-page":"470","DOI":"10.1287\/ijoc.1040.0101","volume":"16","author":"C Stanton","year":"2004","unstructured":"Stanton C, Smith JM (2004) Steiner trees and $$3$$-d macromolecular conformation. INFORMS J Comput 16:470\u2013485","journal-title":"INFORMS J Comput"},{"key":"604_CR42","unstructured":"Warme DM, Winter P, Zachariasen M (1999) Exact solutions to large-scale plane Steiner tree problems. In: Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms. Society for Industrial and Applied Mathematics, USA, pp 979\u2013980"},{"key":"604_CR43","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1002\/net.3230150305","volume":"15","author":"P Winter","year":"1985","unstructured":"Winter P (1985) An algorithm for the steiner problem in the euclidean plane. Networks 15:323\u2013345","journal-title":"Networks"},{"key":"604_CR44","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1002\/(SICI)1097-0037(199710)30:3<149::AID-NET1>3.0.CO;2-L","volume":"30","author":"P Winter","year":"1997","unstructured":"Winter P, Zachariasen M (1997) Euclidean steiner minimum trees: an improved exact algorithm. Networks 30:149\u2013166","journal-title":"Networks"},{"issue":"4","key":"604_CR45","doi-asserted-by":"publisher","first-page":"1017","DOI":"10.1137\/S1052623495288362","volume":"7","author":"G Xue","year":"1997","unstructured":"Xue G, Ye Y (1997) An efficient algorithm for minimizing a sum of euclidean norms with applications. SIAM Journal of Optimization 7(4):1017\u20131036","journal-title":"SIAM Journal of Optimization"},{"key":"604_CR46","doi-asserted-by":"crossref","unstructured":"Yu H, Zhang Q, Cumming BP, et\u00a0al (2021) Neuron-Inspired Steiner Tree Networks for 3D Low-Density Metastructures. Advanced Science 8(19). https:\/\/doi.org\/10.1002\/advs.202100141","DOI":"10.1002\/advs.202100141"}],"container-title":["4OR"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-025-00604-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10288-025-00604-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-025-00604-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,13]],"date-time":"2025-12-13T18:03:36Z","timestamp":1765649016000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10288-025-00604-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,17]]},"references-count":46,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2025,12]]}},"alternative-id":["604"],"URL":"https:\/\/doi.org\/10.1007\/s10288-025-00604-z","relation":{},"ISSN":["1619-4500","1614-2411"],"issn-type":[{"type":"print","value":"1619-4500"},{"type":"electronic","value":"1614-2411"}],"subject":[],"published":{"date-parts":[[2025,10,17]]},"assertion":[{"value":"8 July 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 September 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 September 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 October 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}