Pages that link to "Item:Q1290154"
From MaRDI portal
The following pages link to The Steiner tree problem with hop constraints (Q1290154):
Displaying 41 items.
- Optimal relay node placement in delay constrained wireless sensor network design (Q297218) (← links)
- Hop constrained Steiner trees with multiple root nodes (Q299847) (← links)
- Formulations for the nonbifurcated hop-constrained multicommodity capacitated fixed-charge network design problem (Q337245) (← links)
- A sharp threshold for minimum bounded-depth and bounded-diameter spanning trees and Steiner trees in random networks (Q452816) (← links)
- Restricted dynamic programming based neighborhoods for the hop-constrained minimum spanning tree problem (Q623311) (← links)
- The network design problem with relays (Q869627) (← links)
- A hop constrained min-sum arborescence with outage costs (Q875410) (← links)
- Capacitated lot-sizing with extensions: a review (Q926571) (← links)
- Minimum-energy broadcast and disk cover in grid wireless networks (Q930903) (← links)
- Heuristics for automated knowledge source integration and service composition (Q941554) (← links)
- A model for the capacitated, hop-constrained, per-packet wireless mesh network design problem (Q1014998) (← links)
- Combinatorial optimization in system configuration design (Q1027725) (← links)
- A constrained Steiner tree problem (Q1129916) (← links)
- Branch-and-price approaches for the network design problem with relays (Q1651598) (← links)
- Extended formulation for hop constrained distribution network configuration problems (Q1681271) (← links)
- SCIP-Jack -- a solver for STP and variants with parallelization extensions (Q1699618) (← links)
- Swap-vertex based neighborhood for Steiner tree problems (Q1699620) (← links)
- Compact formulations and an iterated local search-based matheuristic for the minimum weighted feedback vertex set problem (Q2028800) (← links)
- Optimal Steiner trees under node and edge privacy conflicts (Q2156311) (← links)
- A math-heuristic Dantzig-Wolfe algorithm for capacitated lot sizing (Q2248555) (← links)
- Breakout local search for the Steiner tree problem with revenue, budget and hop constraints (Q2255904) (← links)
- A distributed dual ascent algorithm for the Hop-constrained Steiner tree problem (Q2270325) (← links)
- Reducing the diameter of a unit disk graph via node addition (Q2353655) (← links)
- Finding outbreak trees in networks with limited information (Q2357924) (← links)
- Optimal multicast route packing (Q2378485) (← links)
- On the bounded-hop MST problem on random Euclidean instances (Q2382669) (← links)
- Conversion of the Steiner problem on the Euclidean plane to the Steiner problem on graph (Q2457453) (← links)
- Fast heuristics for the Steiner tree problem with revenues, budget and hop constraints (Q2482819) (← links)
- Towards optimizing the deployment of optical access networks (Q2513732) (← links)
- The rainbow Steiner tree problem (Q2669791) (← links)
- An Algorithm to Find the Link Constrained Steiner Tree in Undirected Graphs (Q2819269) (← links)
- Dynamic Programming Driven Memetic Search for the Steiner Tree Problem with Revenues, Budget, and Hop Constraints (Q3466769) (← links)
- Dynamic Steiner Tree Problem (Q3977293) (← links)
- A Lagrangean-based decomposition approach for the link constrained Steiner tree problem (Q4637834) (← links)
- Computing a Minimum-Cost k-Hop Steiner Tree in Tree-Like Metrics (Q5089179) (← links)
- Models and branch‐and‐cut algorithms for the Steiner tree problem with revenues, budget and hop constraints (Q5191136) (← links)
- A new Integer Linear Program for the Steiner Tree Problem with Revenues, Budget and Hop Constraints (Q5232757) (← links)
- Stabilizing branch‐and‐price for constrained tree problems (Q5326785) (← links)
- On Hop-Constrained Steiner Trees in Tree-Like Metrics (Q5864216) (← links)
- A comparison of node‐based and arc‐based hop‐indexed formulations for the Steiner tree problem with hop constraints (Q6066244) (← links)
- New pricing strategies and an effective exact solution framework for profit-oriented ring arborescence problems (Q6109802) (← links)
