Cite
HARVARD Citation
Fortz, B. et al. (n.d.). A branch‐and‐cut algorithm for the ring spur assignment problem. Networks. 61 (2), pp. 89-103. [Online].
This is an interim version of our Electronic Legal Deposit Catalogue-eJournals and eBooks while we continue to recover from a cyber-attack.
Fortz, B. et al. (n.d.). A branch‐and‐cut algorithm for the ring spur assignment problem. Networks. 61 (2), pp. 89-103. [Online].