scientific article; zbMATH DE number 1424551

MaRDI QIDQ4945800zbMATH OpenFDO

Authors Cees Duin

Publication date 23 March 2000

zbMATH Keywords

branch-and-cutinteger programmingpreprocessingSteiner type

Mathematics Subject Classification ID

Trees (05C05) Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• scientific article; zbMATH DE number 4010182
• A branch and cut algorithm for the Steiner problem in graphs
• Preprocessing Steiner problems from VLSI layout
• Some generalizations of the steiner problem in graphs
• An algorithm for the steiner problem in graphs

Cited in

(11)

• Thinning out Steiner trees: a node-based model for uniform edge costs
• scientific article; zbMATH DE number 4164200 (Why is no real title available?)
• Automated knowledge source selection and service composition
• Preprocessing Steiner problems from VLSI layout
• The edge-disjoing steiner problem in graphs
• Implications, conflicts, and reductions for Steiner trees
• Implications, conflicts, and reductions for Steiner trees
• Approximation Algorithms for Steiner Tree Based on Star Contractions: A Unified View
• Solving Steiner trees: Recent advances, challenges, and perspectives
• An optimal algorithm for the stacker crane problem on fixed topologies
• 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 Q4945800)