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 ...

Carpathian Journal of Mathematics, Vol. 25, No. 1 (2009), pp. 104-118 (15 pages) In this survey paper, we discuss the development of the Generalized Minimum Spanning Tree Problem, denoted by GMSTP, ...

Abstract: N points are given in the Euclidean plane, and the minimum spanning tree problem seeks for a minimum spanning tree interconnecting the n points so that there is only one path between any two ...

The Capacitated Minimum Spanning Tree Problem is NP-hard and several heuristic solution methods have been proposed. They can be classified as classical ones and metaheuristics. Recent developments ...