论文信息 - On a nonconvex MINLP formulation of the Euclidean Steiner tree problem in n-space: missing proofs

On a nonconvex MINLP formulation of the Euclidean Steiner tree problem in n-space: missing proofs

We supply proofs for a few key results concerning smoothing square roots and model strengthening for a mixed-integer nonlinear-optimization formulation of the the Euclidean Steiner tree problem.

Jon Lee | Claudia D’Ambrosio | Stefan Vigerske | Marcia Fampa

[1] Nelson Maculan,et al. The Euclidean Steiner tree problem in Rn: A mathematical programming formulation , 2000, Ann. Oper. Res..

[2] Claudia D'Ambrosio,et al. On a Nonconvex MINLP Formulation of the Euclidean Steiner Tree Problem in n-Space , 2015, SEA.

[3] Nelson Maculan,et al. An overview of exact algorithms for the Euclidean Steiner tree problem in n-space , 2016, Int. Trans. Oper. Res..

[4] Lorenz T. Biegler,et al. On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming , 2006, Math. Program..

[5] David S. Johnson,et al. The Complexity of Computing Steiner Minimal Trees , 1977 .

[6] Jon Lee,et al. Virtuous smoothing for global optimization , 2017, J. Glob. Optim..

[7] F. Hwang,et al. The Steiner Tree Problem , 2012 .

[8] Jon Lee,et al. More Virtuous Smoothing , 2019, SIAM J. Optim..

[9] Ding-Zhu Du,et al. Steiner tree problems in computer communication networks , 2008 .