@ARTICLE{Carrabs201358,
author={Carrabs, F. and Cerulli, R. and Speranza, M.G.},
title={A branch-and-bound algorithm for the double travelling salesman problem with two stacks},
journal={Networks},
year={2013},
volume={61},
number={1},
pages={58-75},
url={http://www.scopus.com/inward/record.url?eid=2-s2.0-84870620441&partnerID=40&md5=3424f329394a355d80cec3d52082ecb4},
document_type={Article},
source={Scopus},
}