A branch-and-cut algorithm for the Steiner tree problem with delays
From MaRDI portal
Publication:1926621
DOI10.1007/s11590-011-0368-1zbMath1257.90084OpenAlexW2063522894MaRDI QIDQ1926621
Chefi Triki, Mohamed Haouari, Valeria Leggieri
Publication date: 28 December 2012
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-011-0368-1
Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- The Steiner tree problem with delays: a compact formulation and reduction procedures
- Construction algorithms and approximation bounds for the streaming cache placement problem in multicast networks
- Neural and delay based heuristics for the Steiner problem in networks
- Branching rules revisited
- Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with Hop constraints
- A distributed dual ascent algorithm for the Hop-constrained Steiner tree problem
- A survey of combinatorial optimization problems in multicast routing
- Fast heuristics for the Steiner tree problem with revenues, budget and hop constraints
- Integer Programming Formulation of Traveling Salesman Problems
- An integer linear programming approach to the steiner problem in graphs
- Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition
- A polyhedral study of the asymmetric traveling salesman problem with time windows
- Solving Steiner tree problems in graphs to optimality
- Models and branch‐and‐cut algorithms for the Steiner tree problem with revenues, budget and hop constraints
- Solving the asymmetric travelling salesman problem with time windows by branch-and-cut
- A comparison of Steiner tree relaxations
This page was built for publication: A branch-and-cut algorithm for the Steiner tree problem with delays
