A constrained Steiner tree problem

DOI10.1016/0377-2217(93)E0245-SzbMath0927.90104MaRDI QIDQ1129916

Moshe B. Rosenwein, Richard T. Wong

Publication date: 16 August 1998

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

Steiner tree problemrelaxationone additional side constraint

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items

Finding outbreak trees in networks with limited information, Stabilizing branch‐and‐price for constrained tree problems, Solving Steiner trees: Recent advances, challenges, and perspectives, Optimal Network Design with End-to-End Service Requirements, Heuristics for automated knowledge source integration and service composition, Combinatorial optimization in system configuration design

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Models for planning capacity expansion in local access telecommunication networks
• Improved Lagrangean decomposition: An application to the generalized assignment problem
• The telephonic switching centre network problem: Formalization and computational experience
• An algorithm for the solution of the 0-1 knapsack problem
• Topological design of telecommunication networks --- local access design methods
• A dual ascent approach for steiner tree problems on a directed graph
• An application of lagrangean decomposition to the resource-constrained minimum weighted arborescence problem
• Shortest chain subject to side constraints
• Lagrangean decomposition: A model yielding stronger lagrangean bounds
• Steiner problem in networks: A survey
• An SST-based algorithm for the steiner problem in graphs
• An integer linear programming approach to the steiner problem in graphs
• Solving the Steiner Tree Problem on a Graph Using Branch and Cut
• Validation of subgradient optimization
• A lower bound for the steiner tree problem in directed graphs
• An algorithm for the steiner problem in graphs