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

DOI10.1007/s11590-018-1295-1zbMath1442.90135OpenAlexW2810199373WikidataQ113899975 ScholiaQ113899975MaRDI QIDQ2174883

Stefan Vigerske, Jon Lee, Márcia H. C. Fampa, Claudia D'Ambrosio

Publication date: 27 April 2020

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-018-1295-1

zbMATH Keywords

smoothingrelaxationEuclidean Steiner tree problemmixed-integer nonlinear optimization

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Mixed integer programming (90C11)

Related Items (5)

Mixed integer nonlinear optimization models for the Euclidean Steiner tree problem in \(\mathbb{R}^d\) ⋮ On a nonconvex MINLP formulation of the Euclidean Steiner tree problem in \(n\)-space: missing proofs ⋮ Virtuous smoothing for global optimization ⋮ A new second‐order conic optimization model for the Euclidean Steiner tree problem in Rd$\mathbb {R}^d$ ⋮ A convex approach to the Gilbert-Steiner problem

Cites Work

• The Steiner tree problem
• The Euclidean Steiner tree problem in \(\mathbb{R}^{n}\): A mathematical programming formulation
• Virtuous smoothing for global optimization
• On a nonconvex MINLP formulation of the Euclidean Steiner tree problem in \(n\)-space: missing proofs
• On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
• An overview of exact algorithms for the Euclidean Steiner tree problem inn-space
• The Complexity of Computing Steiner Minimal Trees
• More Virtuous Smoothing
• Unnamed Item

This page was built for publication: On a nonconvex MINLP formulation of the Euclidean Steiner tree problem in \(n\)-space: missing proofs