An Exact Algorithm for the Steiner Tree Problem with Delays

DOI10.1016/j.endm.2010.05.029zbMath1237.90244OpenAlexW2145508846MaRDI QIDQ2883568

Valeria Leggieri, Chefi Triki, Mohamed Haouari

Publication date: 13 May 2012

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2010.05.029

zbMATH Keywords

Steiner tree problembranch-and-cutMTZ subtour elimination constraints

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)

Related Items (4)

Stabilizing branch‐and‐price for constrained tree problems ⋮ A Lagrangean-based decomposition approach for the link constrained Steiner tree problem ⋮ A Layered Graph Model and an Adaptive Layers Framework to Solve Delay-Constrained Minimum Tree Problems ⋮ An Algorithm to Find the Link Constrained Steiner Tree in Undirected Graphs

Cites Work

• The Steiner tree problem with delays: a compact formulation and reduction procedures
• A survey of combinatorial optimization problems in multicast routing
• Integer Programming Formulation of Traveling Salesman Problems
• An integer linear programming approach to the steiner problem in graphs
• Models and branch‐and‐cut algorithms for the Steiner tree problem with revenues, budget and hop constraints
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An Exact Algorithm for the Steiner Tree Problem with Delays