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 ...

We present an origin-based algorithm for the traffic assignment problem, which is similar conceptually to the algorithm proposed by Gallager and Bertsekas for routing in telecommunication networks.

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.