Data, instance sets, and instances generator for the Hop-Constrained Minimum Spanning Tree problem, the Delay-Constrained Minimum Spanning Tree problem, and their bi-objective variants

This article proposes a benchmark instance generator for the Hop-Constrained Minimum Spanning Tree problem, the Delay-Constrained Minimum Spanning Tree problem, and their bi-objective variants. The generator is developed in C++ and does not uses external libraries, being understandable, easy-to-read, and easy-to-use. Furthermore, the generator employs five parameters that makes possible to generate personalized benchmark instances for these problems. We also describe 640 benchmark instances that were previously used in computational experiments in the literature. Lastly, we include raw results obtained from computational experiments with the described benchmark instances. We hope that the data introduced in this article can foster the development and the evaluation of new algorithms for solving constrained minimum spanning tree problems.