The Journal of the Operational Research Society, Vol. 59, No. 7 (Jul., 2008), pp. 963-976 (14 pages) In this paper, we consider a periodic vehicle routing problem that includes, in addition to the ...

A 'branch and bound' algorithm is presented for solving the traveling salesman problem. The set of all tours (feasible solutions) is broken up into increasingly small subsets by a procedure called ...

Nature talked to one of the people behind these algorithm improvements, who was optimistic that they could eventually replicate all of D-Wave's results using non-quantum algorithms.