The GeoSteiner software package for computing Steiner trees in the plane: an updated computational study
type: Item
instance of: scholarly article
title: The GeoSteiner software package for computing Steiner trees in the plane: an updated computational study
zbMATH Open document ID: 1411.90225
author: David M. Warme
author: Pawel Winter
author: Martin Zachariasen
author: Daniel Dahl Juhl
published in: Mathematical Programming Computation
publication date: 2019-05-03T00:00:00Z
full work available at URL: JuhlWarmeWinterZachariasen.pdf
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 05C65
Mathematics Subject Classification ID: 51N20
Mathematics Subject Classification ID: 68W35
zbMATH DE Number: 7050487
zbMATH Keywords: euclidean Steiner tree problem
zbMATH Keywords: rectilinear Steiner tree problem
zbMATH Keywords: fixed orientation Steiner tree problem
zbMATH Keywords: exact algorithm
zbMATH Keywords: computational study
describes a project that uses: OR-Library
describes a project that uses: LEDA
describes a project that uses: CPLEX
describes a project that uses: DIMACS
MaRDI profile type: Publication
OpenAlex ID: W2603633927
cites work: Q4735941
cites work: Canonical forms and algorithms for Steiner trees in uniform orientation metrics
cites work: Steiner trees for fixed orientation metrics
cites work: THE UNIFORM ORIENTATION STEINER TREE PROBLEM IS NP-HARD
cites work: Optimal interconnection trees in the plane. Theory, algorithms and applications
cites work: Solving rectilinear Steiner tree problems exactly in theory and practice
cites work: The Complexity of Computing Steiner Minimal Trees
cites work: The Rectilinear Steiner Tree Problem is $NP$-Complete
cites work: Steiner Minimal Trees
cites work: On Steiner’s Problem with Rectilinear Distance
cites work: Steiner tree problems
cites work: The Steiner tree problem
cites work: Q4718223
cites work: On Steiner trees and minimum spanning trees in hypergraphs
cites work: Thirty‐five‐point rectilinear steiner minimal trees in a day
cites work: An O(n logn) heuristic for steiner minimal tree problems on the euclidean metric
cites work: Q4763327
cites work: Q4395337
cites work: Q4945796
cites work: On Some Distance Problems in Fixed Orientations
cites work: An algorithm for the steiner problem in the euclidean plane
cites work: Euclidean Steiner minimum trees: An improved exact algorithm
cites work: Q4242783
cites work: Rectilinear group Steiner trees and applications in VLSI design
cites work: Concatenation-based greedy heuristics for the Euclidean Steiner tree problem
DOI: 10.1007/S12532-018-0135-8
description: scientific article; zbMATH DE number 7050487