Computational comparison of two methods for finding the shortest complete cycle or circuit in a graphP. Miliotis, G. Laporte and Y. NobertRAIRO-Oper. Res., 15 3 (1981) 233-239DOI: https://doi.org/10.1051/ro/1981150302331
