Cite
HARVARD Citation
Bach, L. et al. (2016). A branch‐and‐cut‐and‐price algorithm for the mixed capacitated general routing problem. Networks. 68 (3), pp. 161-184. [Online].
This is an interim version of our Electronic Legal Deposit Catalogue-eJournals and eBooks while we continue to recover from a cyber-attack.
Bach, L. et al. (2016). A branch‐and‐cut‐and‐price algorithm for the mixed capacitated general routing problem. Networks. 68 (3), pp. 161-184. [Online].