Using multiflow formulations to solve the Steiner tree problem in graphs

Author:

Bahiense LauraORCID,Besso Arthur,Tostas Rogerio,Maculan NelsonORCID

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

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).

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3