A domination algorithm for {0,1}-instances of the travelling salesman problem

Daniela Kühn, Deryk Osthus, Viresh Patel*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

2 Citations (Scopus)
224 Downloads (Pure)

Fingerprint

Dive into the research topics of 'A domination algorithm for {0,1}-instances of the travelling salesman problem'. Together they form a unique fingerprint.

Mathematics

Engineering & Materials Science