{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,15]],"date-time":"2026-02-15T08:46:41Z","timestamp":1771145201895,"version":"3.50.1"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2016,2,15]],"date-time":"2016-02-15T00:00:00Z","timestamp":1455494400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2016,9]]},"DOI":"10.1007\/s10589-016-9835-z","type":"journal-article","created":{"date-parts":[[2016,2,15]],"date-time":"2016-02-15T03:27:25Z","timestamp":1455506845000},"page":"47-71","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["A specialized branch-and-bound algorithm for the Euclidean Steiner tree problem in n-space"],"prefix":"10.1007","volume":"65","author":[{"given":"Marcia","family":"Fampa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jon","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wendel","family":"Melo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,2,15]]},"reference":[{"key":"9835_CR1","series-title":"Applied Optimization","volume-title":"High Performance Optimization","author":"E Andersen","year":"1999","unstructured":"Andersen, E., Andersen, K.: The MOSEK interior point optimizer for linear programming: an implementation of the homogeneous algorithm. In: Frenk, H., et al. (eds.) High Performance Optimization. Applied Optimization, vol. 33. Kluwer, Boston (1999)"},{"key":"9835_CR2","volume-title":"The Design and Analysis of Computer Algorithms","author":"AV Aho","year":"1974","unstructured":"Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, MA (1974)"},{"key":"9835_CR3","doi-asserted-by":"crossref","unstructured":"Beasley, J.E.: OR-Library: distributing test problems by electronic mail. J. Oper. Res. Soc. 41, 1069\u20131072 (1990). http:\/\/people.brunel.ac.uk\/mastjjb\/jeb\/info.html","DOI":"10.1057\/jors.1990.166"},{"key":"9835_CR4","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1080\/10556780903087124","volume":"24","author":"P Belotti","year":"2009","unstructured":"Belotti, P., Lee, J., Liberti, L., Margot, M., W\u00e4chter, A.: Branching and bounds tightening techniques for nonconvex MINLPs. Optim. Methods Softw. 24, 597\u2013634 (2009)","journal-title":"Optim. Methods Softw."},{"issue":"2","key":"9835_CR5","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1016\/j.disopt.2006.10.011","volume":"5","author":"P Bonami","year":"2008","unstructured":"Bonami, P., Biegler, L.T., Conn, A.R., Cornu\u00e9jols, G., Grossmann, I.E., Laird, C.D., Lee, J., Lodi, A., Margot, F., Sawaya, N., W\u00e4chter, A.: An algorithmic framework for convex mixed integer nonlinear programs. Discret. Optim. 5(2), 186\u2013204 (2008)","journal-title":"Discret. Optim."},{"key":"9835_CR6","unstructured":"Bonmin (Basic Open-source Mixed INteger programming). http:\/\/projects.coin-or.org\/Bonmin"},{"key":"9835_CR7","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1007\/BF02592064","volume":"36","author":"M Duran","year":"1986","unstructured":"Duran, M., Grossmann, I.: An outer-approximation algorithm for a class of mixed-integer nonlinear programs. Math. Program. 36, 307\u2013339 (1986)","journal-title":"Math. Program."},{"issue":"2","key":"9835_CR8","doi-asserted-by":"crossref","first-page":"530","DOI":"10.1016\/j.disopt.2007.08.006","volume":"5","author":"M Fampa","year":"2008","unstructured":"Fampa, M., Anstreicher, K.M.: An improved algorithm for computing Steiner minimal trees in Euclidean $$d$$ d -space. Discret. Optim. 5(2), 530\u2013540 (2008)","journal-title":"Discret. Optim."},{"key":"9835_CR9","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1023\/B:NUMA.0000021765.17831.bc","volume":"35","author":"M Fampa","year":"2004","unstructured":"Fampa, M., Maculan, N.: Using a conic formulation for finding Steiner minimal trees. Numer. Algorithms 35, 315\u2013330 (2004)","journal-title":"Numer. Algorithms"},{"issue":"4","key":"9835_CR10","doi-asserted-by":"crossref","first-page":"835","DOI":"10.1137\/0132072","volume":"32","author":"MR Garey","year":"1977","unstructured":"Garey, M.R., Graham, R.L., Johnson, D.S.: The complexity of computing Steiner minimal trees. SIAM J. Appl. Math. 32(4), 835\u2013859 (1977)","journal-title":"SIAM J. Appl. Math."},{"key":"9835_CR11","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1080\/10556788.2011.648932","volume":"28","author":"I Gentilini","year":"2013","unstructured":"Gentilini, I., Margot, F., Shimada, K.: The traveling salesman problem with neighborhoods: MINLP solution. Optim. Methods Softw. 28, 364\u2013378 (2013)","journal-title":"Optim. Methods Softw."},{"key":"9835_CR12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/0116001","volume":"16","author":"EN Gilbert","year":"1968","unstructured":"Gilbert, E.N., Pollack, H.O.: Steiner minimal trees. SIAM J. Appl. Math. 16, 1\u201329 (1968)","journal-title":"SIAM J. Appl. Math."},{"issue":"12","key":"9835_CR13","doi-asserted-by":"crossref","first-page":"1533","DOI":"10.1287\/mnsc.31.12.1533","volume":"31","author":"OK Gupta","year":"1985","unstructured":"Gupta, O.K., Ravindran, A.: Branch and bound experiments in convex nonlinear integer programming. Manag. Sci. 31(12), 1533\u20131546 (1985)","journal-title":"Manag. Sci."},{"key":"9835_CR14","series-title":"Annals of Discrete Mathematics","volume-title":"The Steiner Tree Problem","author":"FK Hwang","year":"1992","unstructured":"Hwang, F.K., Richards, D.S., Winter, W.: The Steiner Tree Problem. Annals of Discrete Mathematics, vol. 53. Elsevier, Amsterdan (1992)"},{"key":"9835_CR15","doi-asserted-by":"crossref","first-page":"961","DOI":"10.2140\/pjm.1957.7.961","volume":"7","author":"PJ Kelly","year":"1957","unstructured":"Kelly, P.J.: A congruence theorem for trees. Pac. J. Math. 7, 961\u2013968 (1957)","journal-title":"Pac. J. Math."},{"key":"9835_CR16","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0333-9","volume-title":"The Graph Isomorphism Problem: Its Structural Complexity","author":"J K\u00f6ber","year":"1993","unstructured":"K\u00f6ber, J., Sch\u00f6ning, U., Tor\u00e1n, J.: The Graph Isomorphism Problem: Its Structural Complexity. Birkhauser, Boston (1993)"},{"key":"9835_CR17","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1023\/A:1018903619285","volume":"96","author":"N Maculan","year":"2000","unstructured":"Maculan, N., Michelon, P., Xavier, A.E.: The Euclidean Steiner problem in $${\\mathbb{R}}^n$$ R n : a mathematical programming formulation. Ann. Oper. Res. 96, 209\u2013220 (2000)","journal-title":"Ann. Oper. Res."},{"key":"9835_CR18","volume-title":"50 Years of Integer Programming","author":"F Margot","year":"2009","unstructured":"Margot, F.: Symmetry in integer linear programming. In: Juenger, et al. (eds.) 50 Years of Integer Programming. Springer, Berlin (2009)"},{"key":"9835_CR19","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/s10107-002-0358-2","volume":"94","author":"F Margot","year":"2002","unstructured":"Margot, F.: Pruning by isomorphism in branch-and-cut. Math. Program. 94, 71\u201390 (2002)","journal-title":"Math. Program."},{"key":"9835_CR20","volume-title":"Nauty Users Guide (Version 1.5)","author":"BD McKay","year":"2002","unstructured":"McKay, B.D.: Nauty Users Guide (Version 1.5). Australian National University, Canberra (2002)"},{"key":"9835_CR21","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/s10898-014-0217-8","volume":"60","author":"W Melo","year":"2014","unstructured":"Melo, W., Fampa, M., Raupp, F.: Integrating nonlinear branch-and-bound and outer approximation for convex mixed integer nonlinear programming. J. Glob. Optim. 60, 373\u2013389 (2014)","journal-title":"J. Glob. Optim."},{"issue":"1","key":"9835_CR22","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/s10107-009-0273-x","volume":"126","author":"J Ostrowski","year":"2011","unstructured":"Ostrowski, J., Linderoth, J., Rossi, F., Smriglio, S.: Orbital branching. Math. Program. 126(1), 147\u2013178 (2011)","journal-title":"Math. Program."},{"key":"9835_CR23","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/BF01758756","volume":"7","author":"WD Smith","year":"1992","unstructured":"Smith, W.D.: How to find Steiner minimal trees in Euclidean $$d$$ d -space. Algorithmica 7, 137\u2013177 (1992)","journal-title":"Algorithmica"},{"key":"9835_CR24","first-page":"48","volume":"15","author":"J Soukup","year":"1973","unstructured":"Soukup, J., Chow, W.F.: Set of test problems for minimum length connection networks. ACM\/SIGMAP Newslett. 15, 48\u201351 (1973)","journal-title":"ACM\/SIGMAP Newslett."},{"issue":"5","key":"9835_CR25","doi-asserted-by":"crossref","first-page":"520","DOI":"10.1016\/j.comgeo.2011.11.007","volume":"46","author":"JW Laarhoven Van","year":"2013","unstructured":"Van Laarhoven, J.W., Anstreicher, K.M.: Geometric conditions for Euclidean Steiner trees in $$R^d$$ R d . Comput. Geom. Theory Appl. 46(5), 520\u2013531 (2013)","journal-title":"Comput. Geom. Theory Appl."},{"key":"9835_CR26","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/978-1-4757-3171-2_6","volume-title":"Advances in Steiner Trees","author":"DM Warme","year":"2000","unstructured":"Warme, D.M., Winter, P., Zachariasen, M.: Exact algorithms for plane Steiner tree problems: a computational study. In: Du, D.Z., Smith, J.M., Rubinstein, J.H. (eds.) Advances in Steiner Trees, pp. 81\u2013116. Kluwer Academic Publishers, Boston (2000)"},{"key":"9835_CR27","doi-asserted-by":"crossref","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.: Euclidean Steiner minimum trees: an improved exact algorithm. Networks 30, 149\u2013166 (1997)","journal-title":"Networks"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-016-9835-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-016-9835-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-016-9835-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T14:37:42Z","timestamp":1559227062000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-016-9835-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,2,15]]},"references-count":27,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,9]]}},"alternative-id":["9835"],"URL":"https:\/\/doi.org\/10.1007\/s10589-016-9835-z","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,2,15]]}}}