Solving the prize‐collecting Euclidean Steiner tree problem-Reference-Cited by-同舟云学术

Solving the prize‐collecting Euclidean Steiner tree problem

Published:2020-08-05 Issue:3 Volume:29 Page:1479-1501
ISSN:0969-6016
Container-title:International Transactions in Operational Research
language:en
Short-container-title:Intl. Trans. in Op. Res.

Author:

Whittle David¹^ORCID,Brazil Marcus²^ORCID,Grossman Peter A.¹^ORCID,Rubinstein J. Hyam³^ORCID,Thomas Doreen A.¹^ORCID

Affiliation:

1. Department of Mechanical Engineering The University of Melbourne Parkville VIC 3010 Australia

2. Department of Electrical & Electronic Engineering The University of Melbourne Parkville VIC 3010 Australia

3. Department of Mathematics and Statistics The University of Melbourne Parkville VIC 3010 Australia

Funder

Gilbert Rigg Scholarship

John Collier Scholarship

Publisher

Wiley

Subject

Management of Technology and Innovation,Management Science and Operations Research,Strategy and Management,Computer Science Applications,Business and International Management

Link

https://onlinelibrary.wiley.com/doi/pdf/10.1111/itor.12853

Reference21 articles.

1. Optimal Interconnection Trees in the Plane

2. A NEW BOUND FOR EUCLIDEAN STEINER MINIMAL TREES

3. De Wet P.O. 2009. Geometric Steiner minimal trees. PhD thesis University of South Africa Pretoria.

4. SCIP-Jack—a solver for STP and variants with parallelization extensions

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Exact and heuristic solutions for the prize‐collecting geometric enclosure problem;International Transactions in Operational Research;2024-01-13

2. A new second‐order conic optimization model for the Euclidean Steiner tree problem in Rd$\mathbb {R}^d$;International Transactions in Operational Research;2023-02-18

3. Minimum Steiner trees on a set of concyclic points and their center;International Transactions in Operational Research;2021-09-13

4. An effective two‐level solution approach for the prize‐collecting generalized minimum spanning tree problem by iterated local search;International Transactions in Operational Research;2020-10-02