scientific article; zbMATH DE number 4139520

MaRDI QIDQ3471884zbMATH OpenFDO

Authors Stefan Voß

Publication date 1989

zbMATH Keywords

branch-and-boundheuristic elimination rulesreduction methodsSteiner graph problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Programming involving graphs or networks (90C35)

Recommendations

• On reductions for the Steiner problem in graphs
• Reduction tests for the steiner problem in grapsh
• An edge elimination test for the Steiner problem in graphs
• Steiner's problem in graphs: Heuristic methods
• A branch and cut algorithm for the Steiner problem in graphs

Cited in

(8)

• An edge elimination test for the Steiner problem in graphs
• Steiner's problem in graphs: Heuristic methods
• Reduction tests for the prize-collecting Steiner problem
• Problem reduction methods and a tree generation algorithm for the steiner network problem
• Reduction tests for the steiner problem in grapsh
• scientific article; zbMATH DE number 1163709 (Why is no real title available?)
• Reductions for the rectilinear steiner tree problem
• On reductions for the Steiner problem in graphs

This page was built for publication:

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