Cite
HARVARD Citation
Dong, Y. et al. (n.d.). A compact linear programming formulation of the maximum concurrent flow problem. Networks. 65 (1), pp. 68-87. [Online].
This is an interim version of our Electronic Legal Deposit Catalogue-eJournals and eBooks while we continue to recover from a cyber-attack.
Dong, Y. et al. (n.d.). A compact linear programming formulation of the maximum concurrent flow problem. Networks. 65 (1), pp. 68-87. [Online].