Solving the prize‐collecting Euclidean Steiner tree problem

DOI10.1111/itor.12853OpenAlexW3047200489WikidataQ114080811 ScholiaQ114080811MaRDI QIDQ6071078

Joachim Hyam Rubinstein, Doreen Anne Thomas, P. A. Grossman, Unnamed Author, Marcus Brazil

Publication date: 27 November 2023

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/itor.12853

zbMATH Keywords

prize-collecting Steiner treeprize-collecting Euclidean Steiner treenode weighted geometric Steiner tree

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Related Items (1)

An effective two‐level solution approach for the prize‐collecting generalized minimum spanning tree problem by iterated local search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Steiner ratio conjecture for six points
• On the complexity of the Steiner problem
• SCIP-Jack -- a solver for STP and variants with parallelization extensions
• Optimal Steiner hull algorithm
• Optimal interconnection trees in the plane. Theory, algorithms and applications
• Approximation schemes for node-weighted geometric Steiner tree problems
• An efficient algorithm for determining the convex hull of a finite planar set
• The Complexity of Computing Steiner Minimal Trees
• A General Approximation Technique for Constrained Forest Problems
• Steiner Minimal Trees

This page was built for publication: Solving the prize‐collecting Euclidean Steiner tree problem