Using multiflow formulations to solve the Steiner tree problem in graphs

DOI10.1051/RO/2020023MaRDI QIDQ5002224zbMATH OpenOpenAlexFDO

Authors Laura Bahiense, Arthur Besso, Rogerio Tostas, Nelson Maculan

Publication date 27 July 2021

Published in RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1051/ro/2020023

zbMATH Keywords

linear relaxationsmultiflow formulationsSteiner problem in graphs

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Recommendations

• Solving Steiner tree problems in graphs to optimality
• The multi-weighted Steiner tree problem
• The multi-weighted Steiner tree problem: A reformulation by intersection
• A branch-and-cut algorithm for solving generalized multiperiod Steiner problems in graphs
• An integer programming formulation of the Steiner problem in graphs
• Mixed integer programming formulations for Steiner tree and quality of service multicast tree problems
• Solving Steiner trees: Recent advances, challenges, and perspectives
• The Steiner tree problem. I: Formulations, compositions and extensions and extension of facets
• Solving Steiner tree problems in graphs with Lagrangian relaxation
• A catalog of steiner tree formulations

Cited in

(5)

• Thinning out Steiner trees: a node-based model for uniform edge costs
• Mixed integer programming formulations for Steiner tree and quality of service multicast tree problems
• Angle-Restricted Steiner Arborescences for Flow Map Layout
• scientific article; zbMATH DE number 4089579 (Why is no real title available?)
• scientific article; zbMATH DE number 1982172 (Why is no real title available?)

Describes a project that uses

Uses Software

• OR-Library

This page was built for publication: Using multiflow formulations to solve the Steiner tree problem in graphs

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