Sign Up to like & get
recommendations!
1
Published in 2018 at "Soft Computing"
DOI: 10.1007/s00500-017-2630-7
Abstract: The Steiner tree problem (STP) is a challenging NP-Hard combinatorial optimization problem. The STP with revenue, budget and hop constraints (STPRBH) determines a subtree of a given undirected graph with the defined constraints. In this…
read more here.
Keywords:
revenue budget;
algorithm;
search;
tree problem ... See more keywords