Open AccessA construction heuristic for the capacitated Steiner tree problem
Author(s) -
Simon Van den Eynde,
Pieter Audenaert,
Didier Colle,
Mario Pickavet
Publication year - 2022
Publication title -
plos one
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.99
H-Index - 332
ISSN - 1932-6203
DOI - 10.1371/journal.pone.0270147
Subject(s) - steiner tree problem , heuristic , shortest path problem , computer science , mathematical optimization , construct (python library) , integer (computer science) , node (physics) , path (computing) , quadratic equation , integer programming , tree (set theory) , graph , mathematics , combinatorics , theoretical computer science , computer network , engineering , geometry , structural engineering , programming language
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom