A branch and cut algorithm for the Steiner problem in graphs

DOI10.1002/(SICI)1097-0037(199801)31:1%3C39::AID-NET5%3E3.0.CO;2-LMaRDI QIDQ4378527zbMATH OpenOpenAlexFDO

Authors Abilio Lucena, J. E. Beasley

Publication date 5 March 1998

Full work available at URL https://doi.org/10.1002/(sici)1097-0037(199801)31:1%3C39::aid-net5%3E3.0.co;2-l

zbMATH Keywords

branch-and-cut algorithmshortest spanning treeSteiner problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Recommendations

• An SST-based algorithm for the steiner problem in graphs
• Solving Steiner tree problems in graphs to optimality
• Solving the Steiner Tree Problem on a Graph Using Branch and Cut
• An algorithm for the steiner problem in graphs
• scientific article; zbMATH DE number 4010182

Cited in

(32)

• A branch-and-cut algorithm for the equicut problem
• Binary Steiner trees: structural results and an exact solution approach
• Solving minimum-cost shared arborescence problems
• A heuristic for the Steiner problem in graphs
• Toward solving the Steiner travelling salesman problem on urban road maps using the branch decomposition of graphs
• Branch-and-cut algorithms for Steiner tree problems with privacy conflicts
• Polyhedral results and a branch-and-cut algorithm for the \(k\)-cardinality tree problem
• The Steiner connectivity problem
• Branch and Cut based on the volume algorithm: Steiner trees in graphs and Max-cut
• scientific article; zbMATH DE number 4139520 (Why is no real title available?)
• scientific article; zbMATH DE number 4010182 (Why is no real title available?)
• An SST-based algorithm for the steiner problem in graphs
• Solving the Steiner Tree Problem on a Graph Using Branch and Cut
• scientific article; zbMATH DE number 1064585 (Why is no real title available?)
• A branch-and-cut algorithm for solving generalized multiperiod Steiner problems in graphs
• Solving Steiner tree problems in graphs to optimality
• scientific article; zbMATH DE number 1424551 (Why is no real title available?)
• An Exact Algorithm for the Steiner Forest Problem
• Exact methods for solving the elementary shortest and longest path problems
• Directed Steiner Tree Problem On A Graph: Models, Relaxations And Algorithms
• On the Minimal Steiner Tree Subproblem and Its Application in Branch-and-Price
• A branch-and-cut to the point-to-point connection problem on multicast networks
• A Branch and Cut Algorithm for a Steiner Tree-Star Problem
• An algorithm for the steiner problem in graphs
• Improved algorithms for the Steiner problem in networks
• An exact branch and bound algorithm for the Steiner Problem in Graphs
• Solving Steiner trees: Recent advances, challenges, and perspectives
• Optimizing the Design of a Wind Farm Collection Network
• Tree network design avoiding congestion
• NeuroPrim: an attention-based model for solving NP-hard spanning tree problems
• Non delayed relax-and-cut algorithms
• Heuristics for automated knowledge source integration and service composition

This page was built for publication: A branch and cut algorithm for the Steiner problem in graphs

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