* Euclidean Steiner Tree Problem in the Plane * Rectilinear Steiner Tree Problem in the Plane * Minimum Spanning Tree Problem in Hypergraphs
The code is written in ANSI C and requires no supplementary software or libraries. The code makes heavy use of linear programming (LP); the public domain LP-solver lp_solve is included (in a significantly modified form). However, the package also supports CPLEX, a proprietary product of the CPLEX division of ILOG Inc., which probably is the fastest and most robust LP-solver available.
Steiner Tree (10)