A constrained Steiner tree problem
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4010182 (Why is no real title available?)
- scientific article; zbMATH DE number 3542191 (Why is no real title available?)
- scientific article; zbMATH DE number 3614502 (Why is no real title available?)
- A dual ascent approach for steiner tree problems on a directed graph
- A lower bound for the steiner tree problem in directed graphs
- An SST-based algorithm for the steiner problem in graphs
- An algorithm for the solution of the 0-1 knapsack problem
- An algorithm for the steiner problem in graphs
- An application of lagrangean decomposition to the resource-constrained minimum weighted arborescence problem
- An integer linear programming approach to the steiner problem in graphs
- Improved Lagrangean decomposition: An application to the generalized assignment problem
- Lagrangean decomposition: A model yielding stronger lagrangean bounds
- Models for planning capacity expansion in local access telecommunication networks
- Shortest chain subject to side constraints
- Solving the Steiner Tree Problem on a Graph Using Branch and Cut
- Steiner problem in networks: A survey
- The telephonic switching centre network problem: Formalization and computational experience
- Topological design of telecommunication networks --- local access design methods
- Validation of subgradient optimization
Cited in
(22)- An algorithm to find the link constrained Steiner tree in undirected graphs
- Dynamic Steiner Tree Problem
- Finding outbreak trees in networks with limited information
- Designing a minimal spanning tree network subject to a budget constraint
- Models and branch‐and‐cut algorithms for the Steiner tree problem with revenues, budget and hop constraints
- An initial study of budgeted Steiner networks
- The line connectivity problem
- Heuristics for automated knowledge source integration and service composition
- Optimal network design with end-to-end service requirements
- Combinatorial optimization in system configuration design
- The 1-steiner tree problem
- A Lagrangean-based decomposition approach for the link constrained Steiner tree problem
- The Steiner tree problem
- Optimal Steiner trees under node and edge privacy conflicts
- Stabilizing branch-and-price for constrained tree problems
- Directed Steiner problems with connectivity constraints
- Steiner tree problems
- Diameter-constrained Steiner trees
- On the restricted 1-Steiner tree problem
- Steiner tree problems in telecommunications
- Solving Steiner trees: Recent advances, challenges, and perspectives
- Constrained spanning, Steiner trees and the triangle inequality
This page was built for publication: A constrained Steiner tree problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1129916)
