The Steiner tree problem (STP) in graphs is one of the most studied problems in combinatorial optimization. Since its inception in 1970, numerous articles published in the journal Networks have stimulated new theoretical and computational studies on Steiner trees: from approximation algorithms, heuristics, metaheuristics, all the way to exact algorithms based on (mixed) integer linear programming, fixed parameter tractability, or combinatorial branch‐and‐bounds. The pervasive applicability and relevance of Steiner trees have been reinforced by the recent 11th DIMACS Implementation Challenge in 2014 and the PACE 2018 Challenge. This article provides an overview of the rich developments from the last three decades for the STP in graphs and highlights the most recent computational studies for some of its closely related variants.

中文翻译：

---

解决斯坦纳树：最新进展，挑战和观点

图中的Steiner树问题（STP）是组合优化中研究最多的问题之一。自1970年成立以来，在网络杂志上发表了大量文章激发了Steiner树的新理论和计算研究：从近似算法，启发式算法，元启发式方法，一直到基于（混合）整数线性规划，固定参数可牵引性或组合分支定界的精确算法。最近的2014年第11届DIMACS实施挑战赛和PACE 2018挑战赛进一步加强了Steiner树的普遍适用性和相关性。本文以图形的形式概述了STP在过去三十年中的丰富发展，并重点介绍了一些与之密切相关的变体的最新计算研究。