Using multiflow formulations to solve the Steiner tree problem in graphs

被引：0

作者：

Bahiense, Laura ^{[1
]}

Besso, Arthur ^{[2
]}

Tostas, Rogerio ^{[1
]}

Maculan, Nelson ^{[1
]}

机构：

[1] Univ Fed Rio de Janeiro, Grad Sch & Res Engn, Alberto Luiz Coimbra Inst, Syst Engn & Comp Sci Program, Rio De Janeiro, Brazil

[2] IBGE Fdn CRM GEFET, Rio De Janeiro, Brazil

来源：

RAIRO-OPERATIONS RESEARCH | 2021年 / 55卷

关键词：

Steiner problem in graphs; multiflow formulations; linear relaxations;

D O I：

10.1051/ro/2020023

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

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.

引用

页码：S343 / S350

页数：8

共 50 条

[1] USING GENETIC ALGORTIHM TO SOLVE STEINER MINIMUM SPANNING TREE PROBLEM
Isci, Oznur
Korukoglu, Serdar
PAMUKKALE UNIVERSITY JOURNAL OF ENGINEERING SCIENCES-PAMUKKALE UNIVERSITESI MUHENDISLIK BILIMLERI DERGISI, 2006, 12 (03): : 429 - 437
[2] Some formulations for the group steiner tree problem
Ferreira, Carlos E.
de Oliveira Filho, Fernando M.
DISCRETE APPLIED MATHEMATICS, 2006, 154 (13) : 1877 - 1884
[3] Homogeneously orderable graphs and the Steiner tree problem
Brandstadt, A
Dragan, FF
Nicolai, F
GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 1995, 1017 : 381 - 395
[4] The Steiner tree problem on graphs: Inapproximability results
Chlebik, Miroslav
Chlebikova, Janka
THEORETICAL COMPUTER SCIENCE, 2008, 406 (03) : 207 - 214
[5] Approximation hardness of the Steiner tree problem on graphs
Chlebík, M
Chlebíkov, J
ALGORITHM THEORY - SWAT 2002, 2002, 2368 : 170 - 179
[6] An ant algorithm for the Steiner Tree Problem in graphs
Luyet, Luc
Varone, Sacha
Zufferey, Nicolas
APPLICATIONS OF EVOLUTIONARY COMPUTING, PROCEEDINGS, 2007, 4448 : 42 - +
[7] A Solution Merging Heuristic for the Steiner Problem in Graphs Using Tree Decompositions
Bosman, Thomas
EXPERIMENTAL ALGORITHMS, SEA 2015, 2015, 9125 : 391 - 402
[8] A viral system massive infection algorithm to solve the Steiner tree problem in graphs with medium terminal density
Cortes, Pablo
Garcia, Jose M.
Munuzuri, Jesus
Guadix, Jose
INTERNATIONAL JOURNAL OF BIO-INSPIRED COMPUTATION, 2010, 2 (02) : 71 - 77
[9] A Logic-Based Approach to Solve the Steiner Tree Problem
Menai, Mohamed El Bachir
ARTIFICIAL INTELLIGENCE APPLICATIONS AND INNOVATIONS III, 2009, : 73 - 79
[10] Solving the Steiner tree problem in graphs by chaotic search
Fujita, Misa
Kimura, Takayuki
Ikeguchi, Tohru
IEICE NONLINEAR THEORY AND ITS APPLICATIONS, 2020, 11 (01): : 90 - 108

← 1 2 3 4 5 →