Cite
HARVARD Citation
Benavent, E. et al. (n.d.). A branch‐price‐and‐cut algorithm for the min‐max k‐vehicle windy rural postman problem. Networks. 63 (1), pp. 34-45. [Online].
This is an interim version of our Electronic Legal Deposit Catalogue-eJournals and eBooks while we continue to recover from a cyber-attack.
Benavent, E. et al. (n.d.). A branch‐price‐and‐cut algorithm for the min‐max k‐vehicle windy rural postman problem. Networks. 63 (1), pp. 34-45. [Online].