A Lagrangean-based decomposition approach for the link constrained Steiner tree problem
From MaRDI portal
Recommendations
- An algorithm to find the link constrained Steiner tree in undirected graphs
- A constrained Steiner tree problem
- Solving Steiner tree problems in graphs with Lagrangian relaxation
- Using Lagrangian dual information to generate degree constrained spanning trees
- An application of lagrangean decomposition to the resource-constrained minimum weighted arborescence problem
Cites work
- A 2-path approach for odd-diameter-constrained minimum spanning and Steiner trees
- A distributed dual ascent algorithm for the Hop-constrained Steiner tree problem
- A Faster Algorithm for the Steiner Tree Problem
- A survey of combinatorial optimization problems in multicast routing
- An algorithm to find the link constrained Steiner tree in undirected graphs
- An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem
- An exact algorithm for the Steiner tree problem with delays
- Diameter-constrained Steiner tree
- Fast heuristics for the Steiner tree problem with revenues, budget and hop constraints
- Fast local search for Steiner trees in graphs
- Local search for hop-constrained directed Steiner tree problem with application to UAV-based multi-target surveillance
- Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs
- Network flow models for designing diameter‐constrained minimum‐spanning and Steiner trees
- New primal-dual algorithms for Steiner tree problems
- On solving the Lagrangian dual of integer programs via an incremental approach
- Optimal multicast route packing
- Prize collecting Steiner trees with node degree dependent costs
- Reducibility among combinatorial problems
- SCIP-Jack -- a solver for STP and variants with parallelization extensions
- Solving Steiner tree problems in graphs to optimality
- Solving Steiner tree problems in graphs with Lagrangian relaxation
- Steiner problem in networks: A survey
- Steiner tree problems
- Steiner's problem in graphs and its implications
- The Complexity of Computing Steiner Minimal Trees
- The steiner problem in graphs
- The Steiner tree problem with hop constraints
- Using Variable Redefinition for Computing Lower Bounds for Minimum Spanning and Steiner Trees with Hop Constraints
Cited in
(6)- The rainbow Steiner tree problem
- An algorithm to find the link constrained Steiner tree in undirected graphs
- A Lagrangian Decomposition/Evolutionary Algorithm Hybrid for the Knapsack Constrained Maximum Spanning Tree Problem
- A Lagrangian approach for the minimum spanning tree problem with conflicting edge pairs
- A two-point heuristic to calculate the stepsize in subgradient method with application to a network design problem
- An extended formulation with valid inequalities for the capacitated Steiner arborescence problem
This page was built for publication: A Lagrangean-based decomposition approach for the link constrained Steiner tree problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4637834)
