A Lagrangean-based decomposition approach for the link constrained Steiner tree problem
From MaRDI portal
Publication:4637834
DOI10.1080/10556788.2017.1392518zbMath1398.90189OpenAlexW2767132784WikidataQ58920889 ScholiaQ58920889MaRDI QIDQ4637834
Luigi Di Puglia Pugliese, Giovanna Miglionico, Manlio Gaudioso, Francesca Guerriero
Publication date: 3 May 2018
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556788.2017.1392518
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (2)
The rainbow Steiner tree problem ⋮ A Lagrangian approach for the minimum spanning tree problem with conflicting edge pairs
Uses Software
Cites Work
- Unnamed Item
- Prize collecting Steiner trees with node degree dependent costs
- On solving the Lagrangian dual of integer programs via an incremental approach
- New primal-dual algorithms for Steiner tree problems
- The Steiner tree problem with hop constraints
- Solving Steiner tree problems in graphs with Lagrangian relaxation
- SCIP-Jack -- a solver for STP and variants with parallelization extensions
- A distributed dual ascent algorithm for the Hop-constrained Steiner tree problem
- Optimal multicast route packing
- A survey of combinatorial optimization problems in multicast routing
- Fast heuristics for the Steiner tree problem with revenues, budget and hop constraints
- An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem
- An Algorithm to Find the Link Constrained Steiner Tree in Undirected Graphs
- An Exact Algorithm for the Steiner Tree Problem with Delays
- Diameter-Constrained Steiner Tree
- A 2-path approach for odd-diameter-constrained minimum spanning and Steiner trees
- Steiner problem in networks: A survey
- The Complexity of Computing Steiner Minimal Trees
- Using Variable Redefinition for Computing Lower Bounds for Minimum Spanning and Steiner Trees with Hop Constraints
- Solving Steiner tree problems in graphs to optimality
- Network flow models for designing diameter‐constrained minimum‐spanning and Steiner trees
- Reducibility among Combinatorial Problems
- Fast Local Search for Steiner Trees in Graphs
- A Faster Algorithm for the Steiner Tree Problem
- Steiner's problem in graphs and its implications
- The steiner problem in graphs
- Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs
- Steiner tree problems
This page was built for publication: A Lagrangean-based decomposition approach for the link constrained Steiner tree problem
