Cite
HARVARD Citation
Kühn, D. et al. (2016). A domination algorithm for {0, 1}‐instances of the travelling salesman problem1. Random structures & algorithms. 48 (3), pp. 427-453. [Online].
This is an interim version of our Electronic Legal Deposit Catalogue-eJournals and eBooks while we continue to recover from a cyber-attack.
Kühn, D. et al. (2016). A domination algorithm for {0, 1}‐instances of the travelling salesman problem1. Random structures & algorithms. 48 (3), pp. 427-453. [Online].