Cite
HARVARD Citation
Malaguti, E. et al. (n.d.). A branch‐and‐price algorithm for the (k, c)‐coloring problem. Networks. 65 (4), pp. 353-366. [Online].
This is an interim version of our Electronic Legal Deposit Catalogue-eJournals and eBooks while we continue to recover from a cyber-attack.
Malaguti, E. et al. (n.d.). A branch‐and‐price algorithm for the (k, c)‐coloring problem. Networks. 65 (4), pp. 353-366. [Online].