Alejandro Arbelaez, Deepak Mehta, Barry O'Sullivan, Luis Quesada 0001. A constraint-based parallel local search for the edge-disjoint rooted distance-constrained minimum spanning tree problem. J. Heuristics, 24(3):359-394, 2018. [doi]
@article{ArbelaezMOQ18,
title = {A constraint-based parallel local search for the edge-disjoint rooted distance-constrained minimum spanning tree problem},
author = {Alejandro Arbelaez and Deepak Mehta and Barry O'Sullivan and Luis Quesada 0001},
year = {2018},
doi = {10.1007/s10732-017-9342-0},
url = {https://doi.org/10.1007/s10732-017-9342-0},
researchr = {https://researchr.org/publication/ArbelaezMOQ18},
cites = {0},
citedby = {0},
journal = {J. Heuristics},
volume = {24},
number = {3},
pages = {359-394},
}