The Steiner tree problem with hop constraints
From MaRDI portal
Publication:1290154
DOI10.1023/A:1018967121276zbMath0921.90072MaRDI QIDQ1290154
Publication date: 10 June 1999
Published in: Annals of Operations Research (Search for Journal in Brave)
Programming involving graphs or networks (90C35) Communication networks in operations research (90B18)
Related Items
Finding outbreak trees in networks with limited information, Optimal relay node placement in delay constrained wireless sensor network design, Optimal multicast route packing, On the bounded-hop MST problem on random Euclidean instances, Dynamic Programming Driven Memetic Search for the Steiner Tree Problem with Revenues, Budget, and Hop Constraints, Formulations for the nonbifurcated hop-constrained multicommodity capacitated fixed-charge network design problem, Branch-and-price approaches for the network design problem with relays, Optimal Steiner trees under node and edge privacy conflicts, The network design problem with relays, Stabilizing branch‐and‐price for constrained tree problems, The rainbow Steiner tree problem, Extended formulation for hop constrained distribution network configuration problems, A comparison of node‐based and arc‐based hop‐indexed formulations for the Steiner tree problem with hop constraints, Restricted dynamic programming based neighborhoods for the hop-constrained minimum spanning tree problem, New pricing strategies and an effective exact solution framework for profit-oriented ring arborescence problems, SCIP-Jack -- a solver for STP and variants with parallelization extensions, Swap-vertex based neighborhood for Steiner tree problems, A sharp threshold for minimum bounded-depth and bounded-diameter spanning trees and Steiner trees in random networks, Capacitated lot-sizing with extensions: a review, Minimum-energy broadcast and disk cover in grid wireless networks, Conversion of the Steiner problem on the Euclidean plane to the Steiner problem on graph, A Lagrangean-based decomposition approach for the link constrained Steiner tree problem, Heuristics for automated knowledge source integration and service composition, A math-heuristic Dantzig-Wolfe algorithm for capacitated lot sizing, Breakout local search for the Steiner tree problem with revenue, budget and hop constraints, Fast heuristics for the Steiner tree problem with revenues, budget and hop constraints, Models and branch‐and‐cut algorithms for the Steiner tree problem with revenues, budget and hop constraints, Compact formulations and an iterated local search-based matheuristic for the minimum weighted feedback vertex set problem, Towards optimizing the deployment of optical access networks, A model for the capacitated, hop-constrained, per-packet wireless mesh network design problem, An Algorithm to Find the Link Constrained Steiner Tree in Undirected Graphs, Computing a Minimum-Cost k-Hop Steiner Tree in Tree-Like Metrics, Combinatorial optimization in system configuration design, On Hop-Constrained Steiner Trees in Tree-Like Metrics, Reducing the diameter of a unit disk graph via node addition
