J. H. Rubinstein, D. A. Thomas, Nicholas C. Wormald. A polynomial algorithm for a constrained traveling salesman problem. Networks, 38(2):68-75, 2001. [doi]
@article{RubinsteinTW01,
title = {A polynomial algorithm for a constrained traveling salesman problem},
author = {J. H. Rubinstein and D. A. Thomas and Nicholas C. Wormald},
year = {2001},
doi = {10.1002/net.1025},
url = {http://dx.doi.org/10.1002/net.1025},
tags = {C++},
researchr = {https://researchr.org/publication/RubinsteinTW01},
cites = {0},
citedby = {0},
journal = {Networks},
volume = {38},
number = {2},
pages = {68-75},
}