Cite
HARVARD Citation
Arigliano, A. et al. (2018). A branch‐and‐bound algorithm for the time‐dependent travelling salesman problem. Networks. 72 (3), pp. 382-392. [Online].
This is an interim version of our Electronic Legal Deposit Catalogue-eJournals and eBooks while we continue to recover from a cyber-attack.
Arigliano, A. et al. (2018). A branch‐and‐bound algorithm for the time‐dependent travelling salesman problem. Networks. 72 (3), pp. 382-392. [Online].