Problem reduction methods and a tree generation algorithm for the steiner network problem

DOI10.1002/NET.3230170107zbMATH Open0643.90090OpenAlexW2080156195MaRDI QIDQ3786299FDOQ3786299

Authors: Anantaram Balakrishnan, Nitin R. Patel 

Publication date: 1987

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230170107

Recommendations

• scientific article; zbMATH DE number 1947441
• scientific article; zbMATH DE number 1182759
• Publication:3471884
• Reductions for the rectilinear steiner tree problem
• On reductions for the Steiner problem in graphs
• Solving Steiner tree problems in graphs to optimality
• Steiner tree problems
• Steiner tree problems
• Implications, conflicts, and reductions for Steiner trees
• Implications, conflicts, and reductions for Steiner trees

zbMATH Keywords

minimal spanning treeSteiner network problemminimum weight connected subgraphproblem reduction proceduretree generation algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Programming involving graphs or networks (90C35) Trees (05C05) Combinatorial optimization (90C27)

Cites Work

• On the Problem of Steiner

Cited In (19)

• Reduction tests for the prize-collecting Steiner problem
• An exact branch and bound algorithm for the Steiner Problem in Graphs
• A factoring approach for the Steiner tree problem in undirected networks
• Using structured steiner trees for hierarchical global routing
• Models and algorithms for network reduction
• A comparison of Steiner tree relaxations
• Reductions for the rectilinear steiner tree problem
• Steiner's problem in graphs: Heuristic methods
• Preprocessing Steiner problems from VLSI layout
• Branch-and-bound as a higher-order function
• The role of Steiner hulls in the solution to Steiner tree problems
• An integrated approach to routing and via minimization
• The Steiner tree problem with delays: a compact formulation and reduction procedures
• Path-distance heuristic for the Steiner problem in undirected networks
• Heuristic algorithms for packing of multiple-group multicasting
• Some generalizations of the steiner problem in graphs
• An edge elimination test for the Steiner problem in graphs
• An approach for the Steiner problem in directed graphs
• The multi-weighted Steiner tree problem

This page was built for publication: Problem reduction methods and a tree generation algorithm for the steiner network problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3786299)