Constraint Programming for the Diameter Constrained Minimum Spanning Tree Problem

We propose a new formulation for the Diameter Constrained Minimum Spanning Tree Problem using constraint programming. Computational results have shown that this formulation combined with an appropriate search procedure solves larger instances and is faster than the other approaches in the literature.