An evolutionary multi-start algorithm for the Steiner Tree Problem in graphs with a fast local search.
C++ Other
Switch branches/tags
Nothing to show
Clone or download
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Failed to load latest commit information.
bin
src
LICENSE.txt
Makefile
README.md

README.md

ms-steiner-puw

An evolutionary multi-start algorithm for the Steiner Tree Problem in graphs with a fast local search.

This project is the implementation of the algorithm introduced in the paper A Robust and Scalable Algorithm for the Steiner Problem in Graphs by Thomas Pajor, Eduardo Uchoa, Renato F. Werneck.

The paper is available here: http://arxiv.org/abs/1412.2787