The Steiner tree problem with hop constraints

Recommendations

Hop constrained Steiner trees with multiple root nodes
On the hop constrained Steiner tree problem with multiple root nodes
A constrained Steiner tree problem
Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs
Hop-constrained tree-shaped networks

Cited In (45)

Computing a Minimum-Cost k-Hop Steiner Tree in Tree-Like Metrics
Dynamic Steiner Tree Problem
Stabilizing branch-and-price for constrained tree problems
Optimal Hop-Constrained Trees for Nonlinear Cost Flow Networks
A distributed dual ascent algorithm for the Hop-constrained Steiner tree problem
Dynamic Programming Driven Memetic Search for the Steiner Tree Problem with Revenues, Budget, and Hop Constraints
On Hop-Constrained Steiner Trees in Tree-Like Metrics
Extended formulation for hop constrained distribution network configuration problems
Optimal relay node placement in delay constrained wireless sensor network design
Hop constrained Steiner trees with multiple root nodes
Hop-constrained tree-shaped networks
Reducing the diameter of a unit disk graph via node addition
Minimum-energy broadcast and disk cover in grid wireless networks
New pricing strategies and an effective exact solution framework for profit-oriented ring arborescence problems
Branch-and-price approaches for the network design problem with relays
Restricted dynamic programming based neighborhoods for the hop-constrained minimum spanning tree problem
Compact formulations and an iterated local search-based matheuristic for the minimum weighted feedback vertex set problem
A sharp threshold for minimum bounded-depth and bounded-diameter spanning trees and Steiner trees in random networks
An algorithm to find the link constrained Steiner tree in undirected graphs
A model for the capacitated, hop-constrained, per-packet wireless mesh network design problem
The network design problem with relays
A comparison of node‐based and arc‐based hop‐indexed formulations for the Steiner tree problem with hop constraints
Capacitated lot-sizing with extensions: a review
Optimal Steiner trees under node and edge privacy conflicts
Optimal multicast route packing
Heuristics for automated knowledge source integration and service composition
Models and branch‐and‐cut algorithms for the Steiner tree problem with revenues, budget and hop constraints
Combinatorial optimization in system configuration design
Formulations for the nonbifurcated hop-constrained multicommodity capacitated fixed-charge network design problem
A new Integer Linear Program for the Steiner Tree Problem with Revenues, Budget and Hop Constraints
The rainbow Steiner tree problem
On the hop constrained Steiner tree problem with multiple root nodes
Finding outbreak trees in networks with limited information
A math-heuristic Dantzig-Wolfe algorithm for capacitated lot sizing
Towards optimizing the deployment of optical access networks
Fast heuristics for the Steiner tree problem with revenues, budget and hop constraints
On the bounded-hop MST problem on random Euclidean instances
Swap-vertex based neighborhood for Steiner tree problems
Minimum spanning tree with hop restrictions
A hop constrained min-sum arborescence with outage costs
SCIP-Jack -- a solver for STP and variants with parallelization extensions
Local search for hop-constrained directed Steiner tree problem with application to UAV-based multi-target surveillance
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
Breakout local search for the Steiner tree problem with revenue, budget and hop constraints

This page was built for publication: The Steiner tree problem with hop constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1290154)