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

DOI10.1002/net.3230170107zbMath0643.90090OpenAlexW2080156195MaRDI QIDQ3786299

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

zbMATH Keywords

Steiner network problemminimal spanning treeminimum weight connected subgraphproblem reduction proceduretree generation algorithm

Mathematics Subject Classification ID

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

Related Items

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

Cites Work

• On the Problem of Steiner