Formulations for the Weight‐Constrained Minimum Spanning Tree Problem

We consider the Weight‐constrained Minimum Spanning Tree problem (WMST). The WMST aims at finding a minimum spanning tree such that the overall tree weight does not exceed a specified limit on a graph with costs and weights associated with each edge. We present and compare, from the computational point of view, several formulations for the WMST. From preliminary computational results we propose a model that combines a formulation similar to the well known Miller‐Tucker‐Zemlin formulation with the cut‐set inequalities.