Mixed integer programming formulations for Steiner tree and quality of service multicast tree problems

DOI10.1134/S0361768820080174zbMath1467.68143OpenAlexW3116762271WikidataQ122617053 ScholiaQ122617053MaRDI QIDQ2226969

S. Nesmachnow, Franco Robledo, Claudio E. Risso

Publication date: 9 February 2021

Published in: Programming and Computer Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0361768820080174

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Mixed integer programming (90C11) Graph theory (including graph drawing) in computer science (68R10)

Related Items (1)

Approximation algorithms for priority Steiner tree problems

Uses Software

• SteinLib
• CPLEX

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Steiner tree problem with delays: a compact formulation and reduction procedures
• Minimum-weight two-connected spanning networks
• A new polynomial-time algorithm for linear programming
• Improved approximation algorithms for the quality of service multicast tree problem
• A Hybrid GRASP with Perturbations for the Steiner Problem in Graphs
• A dual ascent approach for steiner tree problems on a directed graph
• A Near-Tight Bound for the Online Steiner Tree Problem in Graphs of Bounded Asymmetry
• An SST-based algorithm for the steiner problem in graphs
• An integer linear programming approach to the steiner problem in graphs
• Solving Steiner tree problems in graphs to optimality
• Multi-Level Steiner Trees.
• A catalog of steiner tree formulations
• Strong Formulations for 2-Node-Connected Steiner Network Problems
• Efficient Greedy Heuristics For Steiner Tree Problems Using Reolptimization And Super Modularity
• A parallel grasp for the Steiner tree problem in graphs using a hybrid local search strategy
• Improved algorithms for the Steiner problem in networks
• A linear programming based approach to the Steiner tree problem with a fixed number of terminals

This page was built for publication: Mixed integer programming formulations for Steiner tree and quality of service multicast tree problems