Hsu-Hao Yang, Yen-Liang Chen. Finding ::::K:::: shortest looping paths in a traffic-light network. Computers & OR, 32:571-581, 2005. [doi]
@article{YangC05:6,
title = {Finding ::::K:::: shortest looping paths in a traffic-light network},
author = {Hsu-Hao Yang and Yen-Liang Chen},
year = {2005},
doi = {10.1016/j.cor.2003.08.004},
url = {http://dx.doi.org/10.1016/j.cor.2003.08.004},
researchr = {https://researchr.org/publication/YangC05%3A6},
cites = {0},
citedby = {0},
journal = {Computers & OR},
volume = {32},
pages = {571-581},
}