An exact branch and bound algorithm for the Steiner Problem in Graphs

DOI10.1007/bfb0030880zbMath1527.68162OpenAlexW1591570516MaRDI QIDQ6085757

Panos M. Pardalos, B. N. Khoury

Publication date: 12 December 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bfb0030880

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• A heuristic for Euclidean and rectilinear Steiner problems
• The Steiner tree problem
• A heuristic for the Steiner problem in graphs
• Problem reduction methods and a tree generation algorithm for the steiner network problem
• An SST-based algorithm for the steiner problem in graphs
• Solving the Steiner Tree Problem on a Graph Using Branch and Cut
• A test problem generator for the Steiner problem in graphs
• Steiner's problem in graphs and its implications
• An algorithm for the steiner problem in graphs
• Unnamed Item

This page was built for publication: An exact branch and bound algorithm for the Steiner Problem in Graphs