Cite
HARVARD Citation
Manerba, D. et al. (n.d.). A branch‐and‐cut algorithm for the multi‐vehicle traveling purchaser problem with pairwise incompatibility constraints. Networks. 65 (2), pp. 139-154. [Online].
This is an interim version of our Electronic Legal Deposit Catalogue-eJournals and eBooks while we continue to recover from a cyber-attack.
Manerba, D. et al. (n.d.). A branch‐and‐cut algorithm for the multi‐vehicle traveling purchaser problem with pairwise incompatibility constraints. Networks. 65 (2), pp. 139-154. [Online].