Cite
HARVARD Citation
Shi, X. et al. (2019). On bilevel minimum and bottleneck spanning tree problems. Networks. 74 (3), pp. 251-273. [Online].
This is an interim version of our Electronic Legal Deposit Catalogue-eJournals and eBooks while we continue to recover from a cyber-attack.
Shi, X. et al. (2019). On bilevel minimum and bottleneck spanning tree problems. Networks. 74 (3), pp. 251-273. [Online].