Stabilized Branch-and-Price for the Rooted Delay-Constrained Steiner Tree Problem

DOI10.1007/978-3-642-21527-8_16MaRDI QIDQ3091493zbMATH OpenOpenAlexWikidataFDO

Authors Markus Leitner, Mario Ruthmair, Günther R. Raidl

Publication date 9 September 2011

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-21527-8_16

Mathematics Subject Classification ID

Mixed integer programming (90C11) Programming involving graphs or networks (90C35)

Recommendations

• On solving the rooted delay- and delay-variation-constrained Steiner tree problem
• Stabilizing branch-and-price for constrained tree problems
• A branch-and-cut algorithm for the Steiner tree problem with delays
• The Steiner tree problem with delays: a compact formulation and reduction procedures
• An exact algorithm for the Steiner tree problem with delays
• scientific article; zbMATH DE number 6264040
• On the Minimal Steiner Tree Subproblem and Its Application in Branch-and-Price
• Branch-and-cut-and-price algorithms for the degree constrained minimum spanning tree problem
• On the hop constrained Steiner tree problem with multiple root nodes

Cited in

(4)

• A branch-and-cut algorithm for the Steiner tree problem with delays
• An exact algorithm for the Steiner tree problem with delays
• On solving the rooted delay- and delay-variation-constrained Steiner tree problem
• Stabilizing branch-and-price for constrained tree problems

Describes a project that uses

Uses Software

• SCIP

This page was built for publication: Stabilized Branch-and-Price for the Rooted Delay-Constrained Steiner Tree Problem

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