Cite
HARVARD Citation
Carrabs, F. et al. (n.d.). A branch‐and‐bound algorithm for the double travelling salesman problem with two stacks. Networks. 61 (1), pp. 58-75. [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. (n.d.). A branch‐and‐bound algorithm for the double travelling salesman problem with two stacks. Networks. 61 (1), pp. 58-75. [Online].