On Solving the Rooted Delay- and Delay-Variation-Constrained Steiner Tree Problem
From MaRDI portal
Publication:3167627
DOI10.1007/978-3-642-32147-4_21zbMath1370.68237OpenAlexW1755108147MaRDI QIDQ3167627
Günther R. Raidl, Mario Ruthmair
Publication date: 2 November 2012
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-32147-4_21
Programming involving graphs or networks (90C35) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Flows in graphs (05C21)
Related Items (2)
Layered graph approaches for combinatorial optimization problems ⋮ Extended formulations and branch-and-cut algorithms for the black-and-white traveling salesman problem
This page was built for publication: On Solving the Rooted Delay- and Delay-Variation-Constrained Steiner Tree Problem
