Cite
MLA Citation
Enrique Benavent et al.. “A branch‐price‐and‐cut algorithm for the min‐max k‐vehicle windy rural postman problem.” Networks, vol. 63, no. 1, n.d., pp. 34–45. http://access.bl.uk/ark:/81055/vdc_100024678480.0x000053
This is an interim version of our Electronic Legal Deposit Catalogue-eJournals and eBooks while we continue to recover from a cyber-attack.
Enrique Benavent et al.. “A branch‐price‐and‐cut algorithm for the min‐max k‐vehicle windy rural postman problem.” Networks, vol. 63, no. 1, n.d., pp. 34–45. http://access.bl.uk/ark:/81055/vdc_100024678480.0x000053