Cite
APA Citation
Carrabs, F., Cerulli, R., & Speranza, M. G. (n.d.). a branch‐and‐bound algorithm for the double travelling salesman problem with two stacks. Networks, 61(1), 58–75. http://access.bl.uk/ark:/81055/vdc_100024745465.0x000037
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., Cerulli, R., & Speranza, M. G. (n.d.). a branch‐and‐bound algorithm for the double travelling salesman problem with two stacks. Networks, 61(1), 58–75. http://access.bl.uk/ark:/81055/vdc_100024745465.0x000037