A specialized branch-and-bound algorithm for the Euclidean Steiner tree problem in n-space
Crossref DOI link: https://doi.org/10.1007/s10589-016-9835-z
Published Online: 2016-02-15
Published Print: 2016-09
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Fampa, Marcia
Lee, Jon
Melo, Wendel
Text and Data Mining valid from 2016-02-15
