• SteinLib

  • Referenced in 104 articles [sw04066]
  • collect freely available instances of Steiner tree problems in graphs and provide some information about ... open forum for difficult Steiner tree instances. We would be happy if you contribute...
  • GeoSteiner

  • Referenced in 22 articles [sw04320]
  • currently the fastest program to calculate Steiner trees. It has been used to solve problems ... code for finding minimum spanning trees in arbitrary hyper graphs, which was applied ... following NP-hard problems: Euclidean Steiner Tree Problem in the Plane, Rectilinear Steiner Tree Problem...
  • SCIP-Jack

  • Referenced in 14 articles [sw18748]
  • variants with parallelization extensions. The Steiner tree problem in graphs is a classical problem that ... often a strong relationship between different Steiner tree problem variants can be observed, solution approaches ... used to solve both the classical Steiner tree problem and many of its variants without...
  • FindSteinerTree

  • Referenced in 12 articles [sw08245]
  • FindSteinerTree is a program for computing Steiner Trees in multiple dimensions, written by Christian Peter ... find Steiner minimal trees in Euclidean d-space. Algorithmica 7:137–177). This algorithm uses ... lengths measured as Euclidean distance (Euclidean Steiner tree). In addition to this, the program also ... lengths as the criterion (Squared-change Steiner tree). This is an extension of Smith...
  • ROPI

  • Referenced in 5 articles [sw11092]
  • continuous side; intermodal load planning, Steiner trees, periodic timetabling, and timetable information on the discrete...
  • stprbh

  • Referenced in 2 articles [sw31781]
  • based layered graph approach for the Steiner tree problem with revenues, budget and hop-constraints ... Steiner tree problem with revenues, budget and hop-constraints (STPRBH) is a variant ... classical Steiner tree problem. The goal is to find a tree maximizing the collected revenue...
  • STPRBH

  • Referenced in 1 article [sw31005]
  • integer linear program for the Steiner tree problem with revenues, budget and hop constraints ... Steiner tree problem with revenues, budgets and hop constraints (STPRBH) is a variant ... classical Steiner tree problem. This problem asks for a subtree in a given graph with...
  • SSTPLib

  • Referenced in 1 article [sw23895]
  • SSTPLib. The Stochastic Steiner Tree Problem...
  • PORA

  • Referenced in 1 article [sw32804]
  • chip functional modules, a rectilinear Steiner minimal tree connecting all the pin vertices while avoiding...
  • CGAL

  • Referenced in 372 articles [sw00118]
  • The goal of the CGAL Open Source Project...
  • CoCoA

  • Referenced in 639 articles [sw00143]
  • CoCoA is a system for Computations in Commutative...
  • GAP

  • Referenced in 3003 articles [sw00320]
  • GAP is a system for computational discrete algebra...
  • KNITRO

  • Referenced in 184 articles [sw00490]
  • KNITRO is a solver for nonlinear optimization. It...
  • LEDA

  • Referenced in 261 articles [sw00509]
  • In the core computer science areas -- data structures...
  • Macaulay2

  • Referenced in 1776 articles [sw00537]
  • Macaulay2 is a software system devoted to supporting...
  • Magma

  • Referenced in 3055 articles [sw00540]
  • Computer algebra system (CAS). Magma is a large...
  • Maple

  • Referenced in 5220 articles [sw00545]
  • The result of over 30 years of cutting...
  • MapReduce

  • Referenced in 253 articles [sw00546]
  • MapReduce is a new parallel programming model initially...
  • Mathematica

  • Referenced in 6129 articles [sw00554]
  • Almost any workflow involves computing results, and that...
  • Matlab

  • Referenced in 12721 articles [sw00558]
  • MATLAB® is a high-level language and interactive...