TwoStageSpanningTree

The goal of this package is to demonstrate and compare several mathematical programming techniques on the same toy problem: the two stage minimum spanning tree problem.

It showcases:

• Cut generation
• Column generation
• Benders decomposition
• Lagrangian relaxation

Installation

This package is not registered, but can be installed as follows:

import Pkg
Pkg.add(url="https://github.com/BatyLeo/TwoStageSpanningTree.jl")