Cargando…
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...
Autores principales: | Carvalho, Iago A., Coco, Amadeu A. |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Elsevier
2023
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10514421/ https://www.ncbi.nlm.nih.gov/pubmed/37743887 http://dx.doi.org/10.1016/j.dib.2023.109553 |
Ejemplares similares
-
A QUBO Formulation of Minimum Multicut Problem Instances in Trees for D-Wave Quantum Annealers
por: Cruz-Santos, William, et al.
Publicado: (2019) -
A Clustering-Enhanced Memetic Algorithm for the Quadratic Minimum Spanning Tree Problem
por: Zhang, Shufan, et al.
Publicado: (2022) -
Minimum spanning tree analysis of the human connectome
por: van Dellen, Edwin, et al.
Publicado: (2018) -
Inference of Cerebrovascular Topology With Geodesic Minimum Spanning Trees
Publicado: (2018) -
Reconstructing B cell lineage trees with minimum spanning tree and genotype abundances
por: Abdollahi, Nika, et al.
Publicado: (2023)