why the standard deterministic traveling salesman problem should not be considered a "legitimate" preference order problem. In short, from a computational, and certainly from a methodological point of ...

Dr. James McCaffrey of Microsoft Research shows how to implement simulated annealing for the Traveling Salesman Problem (find the best ordering of a set of discrete items). The goal of a combinatorial ...