Cite
HARVARD Citation
Mahjoub, M. et al. (2017). The survivable k-node-connected network design problem: Valid inequalities and Branch-and-Cut. Computers & industrial engineering. pp. 690-705. [Online].
This is an interim version of our Electronic Legal Deposit Catalogue-eJournals and eBooks while we continue to recover from a cyber-attack.
Mahjoub, M. et al. (2017). The survivable k-node-connected network design problem: Valid inequalities and Branch-and-Cut. Computers & industrial engineering. pp. 690-705. [Online].