A new heuristic for the Euclidean Steiner Tree Problem in $${\mathbb {R}}^n$$
Crossref DOI link: https://doi.org/10.1007/s11750-022-00642-4
Published Online: 2022-09-06
Published Print: 2023-07
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Pinto, Renan Vicente http://orcid.org/0000-0002-8965-4961
Maculan, Nelson
Text and Data Mining valid from 2022-09-06
Version of Record valid from 2022-09-06
Article History
Received: 19 July 2021
Accepted: 12 August 2022
First Online: 6 September 2022