A branch and cut algorithm for the Steiner problem in graphs

DOI<39::AID-NET5>3.0.CO;2-L 10.1002/(SICI)1097-0037(199801)31:1<39::AID-NET5>3.0.CO;2-LzbMath0894.90155OpenAlexW2170923533MaRDI QIDQ4378527

Abilio Lucena, John E. Beasley

Publication date: 5 March 1998

Full work available at URL: https://doi.org/10.1002/(sici)1097-0037(199801)31:1<39::aid-net5>3.0.co;2-l

zbMATH Keywords

branch-and-cut algorithmSteiner problemshortest spanning tree

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items

Solving Steiner trees: Recent advances, challenges, and perspectives, Optimizing the Design of a Wind Farm Collection Network, Polyhedral results and a branch-and-cut algorithm for the \(k\)-cardinality tree problem, Tree network design avoiding congestion, Heuristics for automated knowledge source integration and service composition, Exact methods for solving the elementary shortest and longest path problems, Binary Steiner trees: structural results and an exact solution approach, Improved algorithms for the Steiner problem in networks, Branch and Cut based on the volume algorithm: Steiner trees in graphs and Max-cut, Non delayed relax-and-cut algorithms