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.
Sign Up to like & get recommendations! 1
Published in 2019 at "Journal of Combinatorial Optimization"
DOI: 10.1007/s10878-019-00428-8
Abstract: AbstractWe study the shared multicast tree (SMT) problem in wireless networks. To support a multicast session between a set of network nodes, SMT aims to establish a wireless connection between them, such that the total… read more here.
Sign Up to like & get recommendations! 1
Published in 2020 at "Optimization Letters"
DOI: 10.1007/s11590-018-1295-1
Abstract: We supply proofs for a few key results concerning smoothing square roots and model strengthening for a mixed-integer nonlinear-optimization formulation of the the Euclidean Steiner tree problem. read more here.
Sign Up to like & get recommendations! 1
Published in 2017 at "Journal of the Operational Research Society"
DOI: 10.1057/s41274-016-0146-7
Abstract: This paper develops a greedy heuristic for the capacitated minimum spanning tree problem (CMSTP), based on the two widely known methods of Prim and of Esau–Williams. The proposed algorithm intertwines two-stages: an enhanced combination of… read more here.
Sign Up to like & get recommendations! 2
Published in 2022 at "PLoS ONE"
DOI: 10.1371/journal.pone.0270147
Abstract: Many real-life problems boil down to a variant of the Minimum Steiner Tree Problem (STP). In telecommunications, Fiber-To-The-Home (FTTH) houses are clustered so they can be connected with fiber as cost-efficiently as possible. The cost… read more here.
Sign Up to like & get recommendations! 0
Published in 2020 at "Scientia Iranica"
DOI: 10.24200/sci.2020.54242.3663
Abstract: The capacitated minimum spanning tree problem (CMSTP), a well-known combinatorial optimiza- tion problem, holds a central place in telecommunication network design. This problem is to fi nd a minimum cost spanning tree with an extra… read more here.
Sign Up to like & get recommendations! 1
Published in 2022 at "Entropy"
DOI: 10.3390/e25010087
Abstract: The quadratic minimum spanning tree problem (QMSTP) is a spanning tree optimization problem that considers the interaction cost between pairs of edges arising from a number of practical scenarios. This problem is NP-hard, and therefore… read more here.
Sign Up to like & get recommendations! 1
Published in 2022 at "Symmetry"
DOI: 10.3390/sym14010106
Abstract: Minimum spanning tree problem (MSTP) has allured many researchers and practitioners due to its varied range of applications in real world scenarios. Modelling these applications involves the incorporation of indeterminate phenomena based on their subjective… read more here.