Cite
HARVARD Citation
Carrabs, F. et al. (2017). A novel discretization scheme for the close enough traveling salesman problem. Computers & operations research. pp. 163-171. [Online].
This is an interim version of our Electronic Legal Deposit Catalogue-eJournals and eBooks while we continue to recover from a cyber-attack.
Carrabs, F. et al. (2017). A novel discretization scheme for the close enough traveling salesman problem. Computers & operations research. pp. 163-171. [Online].