New Benchmark Instances for the Steiner Problem in Graphs (original) (raw)
Related papers
A new metaheuristic and its application to the Steiner problems in graphs
Irene Loiseau, Sebastián Urrutia
SCCC 2001. 21st International Conference of the Chilean Computer Science Society, 2001
Solving Steiner tree problems in graphs to optimality
1998
An Exact Algorithm for Steiner Tree Problem on Graphs
International Journal of Computers Communications & Control, 2006
Directed Steiner Tree Problem on a Graph: Models, Relaxations, and Algorithms
A Robust and Scalable Algorithm for the Steiner Problem in Graphs
Hybrid local search for the Steiner problem in graphs
2001
New real-world instances for the steiner tree problem in graphs
Solving steiner tree problems in graphs with lagrangian relaxation
2003
An Effective Construction Algorithm for the Steiner Tree Problem Based on Edge Betweenness
Kenya Jinno, Takayuki Kimura, Misa Fujita
A new class of Steiner tree heuristics with good performance: the iterated 1-Steiner approach
IEEE International Conference on Computer-Aided Design, 1990
Fast local search for the steiner problem in graphs
ACM Journal of Experimental Algorithms, 2012
Parallel Minimum Spanning Tree Heuristic for the steiner problem in graphs
2007
Exact and heuristic algorithms for the Euclidean Steiner tree problem
2010
An estimate of the objective function optimum for the network Steiner problem
Annals of Operations Research, 2015
A new class of iterative Steiner tree heuristics with good performance
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1992
Discrete Applied Mathematics, 1993
On-line generalized Steiner problem
Theoretical Computer Science, 2004
The Steiner connectivity problem
Mathematical Programming, 2012
Directed Steiner problems with connectivity constraints
Discrete Applied Mathematics, 1993
A Survey of Parallel and Distributed Algorithms for the Steiner Tree Problem
International Journal of Parallel Programming, 2013
The multi-weighted Steiner tree problem: A reformulation by intersection
Computers & Operations Research, 2008
Research and Development on Information and Communication Technology
A specialized branch-and-bound algorithm for the Euclidean Steiner tree problem in n-space
Simple and fast reoptimizations for the Steiner tree problem
A partition-based relaxation for Steiner trees
Mathematical Programming, 2011
Approximation algorithms for directed Steiner problems
Proceedings of the …, 1998
The Steiner problem with edge lengths 1 and 2
Information Processing Letters, 1989
Generalized Steiner problems and other variants
2000
Iterated Greedy Algorithms for the Hop-Constrained Steiner Tree Problem
2018
Speeding up the Dreyfus–Wagner algorithm for minimum Steiner trees
Mathematical Methods of Operations Research, 2007