Minimum Spanning Tree Solver is a C++ project that solves the MST problem using a linear programming formulation via IBM CPLEX and visualizes results using CDT (Conforming Delaunay Triangulation).

This repo contains the code and problem instances accompanying the (forthcoming) paper "Interdiction of minimum spanning trees and other matroid bases" by Noah Weninger and Ricardo Fukasawa. The ...

Abstract: The min-degree constrained minimum spanning tree (MDCMST) problem seeks a spanning tree with minimum total cost such that each non-leaf node in the tree has a degree of at least d in the ...

Abstract: In this paper, a new hybrid genetic algorithm - known as HGA - is proposed for solving the Bounded Diameter Minimum Spanning Tree (BDMST) problem. We experiment with HGA on two sets of ...