Using multiflow formulations to solve the Steiner tree problem in graphs-Reference-Cited by-同舟云学术

Using multiflow formulations to solve the Steiner tree problem in graphs

Published:2021 Issue: Volume:55 Page:S343-S350
ISSN:0399-0559
Container-title:RAIRO - Operations Research
language:
Short-container-title:RAIRO-Oper. Res.

Author:

Bahiense Laura^ORCID,Besso Arthur,Tostas Rogerio,Maculan Nelson^ORCID

Abstract

We present three different mixed integer linear models with a polynomial number of variables and constraints for the Steiner tree problem in graphs. The linear relaxations of these models are compared to show that a good (strong) linear relaxation can be a good approximation for the problem. We present computational results for the STP OR-Library (J.E. Beasley) instances of type b, c, d and e.

Publisher

EDP Sciences

Subject

Management Science and Operations Research,Computer Science Applications,Theoretical Computer Science

Link

https://www.rairo-ro.org/10.1051/ro/2020023/pdf

Reference13 articles.

1. The volume algorithm revisited: relation with bundle methods

2. An algorithm for the steiner problem in graphs

3. Besso A., Problema de Steiner em grafos: Uma experiência numérica para problemas de médio porte utilizando formulações compactas de multi-fluxo. Master’s thesis. Programa de Engenharia de Sistemas e Computação, COPPE, Federal University of Rio de Janeiro, Rio de Janeiro (2015).

4. Claus A. and Maculan N., Une nouvelle formulation du problème de Steiner sur un graphe orienté. In: Publication 315, Centre de Recherche sur les Transports, Université de Montréal, Montréal (1983).

Cited by 1 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Common-Flow Formulations for the Diameter Constrained Spanning and Steiner Tree Problems;International Series in Operations Research & Management Science;2024