A constrained Steiner tree problem
From MaRDI portal
Publication:1129916
DOI10.1016/0377-2217(93)E0245-SzbMATH Open0927.90104MaRDI QIDQ1129916FDOQ1129916
Authors: Moshe B. Rosenwein, Richard T. Wong 
Publication date: 16 August 1998
Published in: European Journal of Operational Research (Search for Journal in Brave)
Recommendations
Cites Work
- Title not available (Why is that?)
- Validation of subgradient optimization
- Steiner problem in networks: A survey
- Lagrangean decomposition: A model yielding stronger lagrangean bounds
- An SST-based algorithm for the steiner problem in graphs
- A dual ascent approach for steiner tree problems on a directed graph
- Shortest chain subject to side constraints
- Topological design of telecommunication networks --- local access design methods
- Title not available (Why is that?)
- An algorithm for the solution of the 0-1 knapsack problem
- Solving the Steiner Tree Problem on a Graph Using Branch and Cut
- Title not available (Why is that?)
- An application of lagrangean decomposition to the resource-constrained minimum weighted arborescence problem
- An integer linear programming approach to the steiner problem in graphs
- Models for planning capacity expansion in local access telecommunication networks
- The telephonic switching centre network problem: Formalization and computational experience
- An algorithm for the steiner problem in graphs
- A lower bound for the steiner tree problem in directed graphs
- Improved Lagrangean decomposition: An application to the generalized assignment problem
Cited In (22)
- Dynamic Steiner Tree Problem
- An initial study of budgeted Steiner networks
- Stabilizing branch-and-price for constrained tree problems
- Constrained spanning, Steiner trees and the triangle inequality
- Steiner tree problems
- On the restricted 1-Steiner tree problem
- The Steiner tree problem
- An algorithm to find the link constrained Steiner tree in undirected graphs
- Optimal Steiner trees under node and edge privacy conflicts
- 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
- Steiner tree problems in telecommunications
- Solving Steiner trees: Recent advances, challenges, and perspectives
- Optimal network design with end-to-end service requirements
- Finding outbreak trees in networks with limited information
- The line connectivity problem
- Directed Steiner problems with connectivity constraints
- The 1-steiner tree problem
- Diameter-constrained Steiner trees
- Designing a minimal spanning tree network subject to a budget constraint
- A Lagrangean-based decomposition approach for the link constrained Steiner tree problem
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)
