stoneTrees: Solve Minimum Steiner Tree (MStT) and Maximum-Weight...

stoneTreesR Documentation

Solve Minimum Steiner Tree (MStT) and Maximum-Weight Connected Subgraph Problems Using Integer Linear Programming

Description

A package dedicated to finding minimum Steiner trees in networks. Particularly biological ones, which tend to be very sparse and on the easier end of the spectrum. This package is especially interested in Minimum Steiner Tree (MStT) and Maximum-Weight Connected Subgraph (MWCS) problems.

Details

This package serves as a faithful implementation of "Thinning out Steiner Trees" (with a few bells and whistles added on the sides).

Author(s)

Adam Sardar

References

Fischetti M, Leitner M, Ljubić I, Luipersbeck M, Monaci M, Resch M, et al. Thinning out Steiner trees: a node-based model for uniform edge costs. Math Program Comput. dimacs11.cs.princeton.edu; 2017


adamsardar/stoneTrees documentation built on May 20, 2022, 7:38 p.m.