Cite
HARVARD Citation
Radha Krishnan, D. et al. (2022). A branch‐and‐cut algorithm for the pickup‐and‐delivery traveling salesman problem with handling costs. Networks. 80 (3), pp. 297-313. [Online].
This is an interim version of our Electronic Legal Deposit Catalogue-eJournals and eBooks while we continue to recover from a cyber-attack.
Radha Krishnan, D. et al. (2022). A branch‐and‐cut algorithm for the pickup‐and‐delivery traveling salesman problem with handling costs. Networks. 80 (3), pp. 297-313. [Online].