Cite
HARVARD Citation
Kabakulak, B. et al. (2020). A branch‐and‐cut algorithm for a bipartite graph construction problem in digital communication systems. Networks. 75 (2), pp. 137-157. [Online].
This is an interim version of our Electronic Legal Deposit Catalogue-eJournals and eBooks while we continue to recover from a cyber-attack.
Kabakulak, B. et al. (2020). A branch‐and‐cut algorithm for a bipartite graph construction problem in digital communication systems. Networks. 75 (2), pp. 137-157. [Online].