On Sat, Oct 12, 2013 at 2:06 PM, Robert Bernecky <[email protected]> wrote: > A harder problem is that of the "travelling salesman problem", > in which we want to compute the shortest route that visits a > set of cities exactly once, and returns to its starting point. > The key here is "shortest": we can easily verify that a putative > solution visits each city once and returns to its starting point, > but we do not have any good way to ensure that the > putative solution is, in fact, the shortest one, except by > trying all of them.
But how might one represent the topology of the available routes to the d-wave chip? Thanks, -- Raul ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
