Queen Mary University of London

Combinatorics Study Group

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