Abstract
New mixed integer nonlinear optimization models for the Euclidean Steiner tree problem in d-space (with \(d\ge 3\)) will be presented in this work. All models feature a nonsmooth objective function but the continuous relaxations of their set of feasible solutions are convex. From these models, four convex mixed integer linear and nonlinear relaxations will be considered. Each relaxation has the same set of feasible solutions as the set of feasible solutions of the model from which it is derived. Finally, preliminary computational results highlighting the main features of the presented relaxations will be discussed.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Brazil, M., Graham, R.L., Thomas, D.A., Zachariasen, M.: On the history of the Euclidean Steiner tree problem. Arch. Hist. Exact Sci. 68, 327–354 (2014)
Garey, M.R., Johnson, D.S.: Computers and intractability: a guide to the theory of NP-Completeness. W.H. Freeman and Company, San Francisco, CA, USA (1979)
Garey, M.R., Graham, R.L., Johnson, D.S.: Complexity of computing Steiner minimal trees. SIAM J. Appl. Math. 32(4), 835–859 (1977)
Montenegro, F., Torreão, J.R.A., Maculan, N.: Microcanonical optimization for the Euclidean Steiner problem in \({\mathbb{R}}^n\) with application to phylogenetic inference. Phys. Rev. E 68, 056702 (2003)
Cavalli-Sforza, L.L., Edwards, A.W.F.: Phylogenetic analysis: models and estimation procedures. Evolution 21, 550–570 (1967)
Brazil, M., Thomas, D.A., Nielson, B.K., Winter, P., Wulff-Nilsen, C., Zachariasen, M.: A novel approach to phylogenetic trees: \(d\)-dimensional geoemtric Steiner trees. Networks 53(2), 104–111 (2009)
Stanton, C., Smith, J.M.: Steiner trees and \(3\)-d macromolecular conformation. Inform. J. Comput. 16, 470–485 (2004)
Smith, J.M., Jang, Y., Kim, M.K.: Steiner minimal trees, twist angles, and the protein folding problem. Prot. Struct. Funct. Bioinform. 66(4), 889–902 (2007)
Zachariasen, M.: Large Euclidean Steiner minimum trees in an hour. PhD thesis, University of Copenhagen (1998)
Warm, D.M., Zachariasen, M.: Large Euclidean Steiner minimum trees in an hour. In: ISMP (1997)
Warm, D.M., Winter, P., Zachariasen, M.: Exact algorithms for plan Steiner tree problems: a computational study. Technical report (1998)
Fampa, M.H.C., Lee, J., Maculan, N.: An overview of exact algorithms for the Euclidean Steiner tree problem in \(n\)-space. Int. Trans. Op. Res. (ITOR) 23(4), 861–874 (2016)
Gilbert, E.N., Pollak, H.O.: Steiner minimal trees. SIAM J. Appl. Math. 16(1), 1–29 (1968)
Smith, W.D.: How to find Steiner minimal trees in Euclidean \(d\)-space. Algorithmica 7(2–3), 137–177 (1992)
Maculan, N., Michelon, Ph., Xavier, A.E.: The Euclidean Steiner tree problem in \(\mathbb{R}^n:\) a mathematical programming formulation. Ann. Op. Res. 96, 209–220 (2000)
Fampa, M.H.C., Maculan, N.: A new relaxation in conic form for the Euclidean Steiner problem in \(\mathbb{R}^n\). RAIRO - Op. Res. 35(4), 283–394 (2001)
Fampa, M.H.C., Maculan, N.: Using a conic formulation for finding Steiner minimal trees. Num. Algorithms 35(4), 315–330 (2004)
D’Ambrosio, C., Fampa, M.H.C., Lee, J., Vigerske, S.: On a nonconvex MINLP formulation of the Euclidean Steiner tree problem in n-space: missing proofs. Optim. Lett. 14, 409–415 (2020)
Fampa, M.: Insight into the computation of Steiner minimal trees in Euclidean space of general dimension. Discrete Applied Mathematics (2019). https://doi.org/10.1016/j.dam.2019.03.015
Fampa, M., Anstreicher, K.: An improved algorithm for computing Steiner minimal trees in Euclidean \(d\)-space. Disc. Optim. 5, 530–540 (2008)
Fampa, M., Lee, J., Melo, W.: A specialized branch-and-bound algorithm for the Euclidean Steiner tree problem in \(n\)-pace. Comput. Optim. Appl. 65, 47–71 (2016)
Fonseca, R., Brazil, M., Winter, P., Zachariasen, M.: Faster exact algorithms for computing Steiner trees in higher dimensional Euclidean spaces. Presented at the \(11\)th DIMACS implementation challenge workshop, http://dimacs11.zib.de/workshop/FonsecaBrazilWinterZachariasen.pdf (2014)
Van Laarhoven, J.W., Anstreicher, K.M.: Geometric conditions for Euclidean Steiner trees in \(\mathbb{R}^d\). Comput. Geom. 46, 520–531 (2013)
Acknowledgements
We are grateful to the referee for her (or his) careful reading, insightful and precise comments. This work was partially supported by the National Council for Scientific and Technological Development - CNPq, under grant 302578/2014-5, COPPETEC Foundation, and by CAPES-MEC.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Ouzia, H., Maculan, N. Mixed integer nonlinear optimization models for the Euclidean Steiner tree problem in \(\mathbb {R}^d\). J Glob Optim 83, 119–136 (2022). https://doi.org/10.1007/s10898-021-01001-6
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10898-021-01001-6