The traveling salesman problem : a computational study /
Applegate, David L.
Princeton ; Oxford : Princeton University Press,
c2006.
Includes bibliographical references (p. [541]-581) and index.
The problem -- Applications -- Dantzig, Fulkerson, and Johnson -- History of TSP computation -- LP bounds and cutting planes -- Subtour cuts and PQ-trees -- Cuts from blossoms and blocks -- Combs from consecutive ones -- Combs from dominoes -- Cut metamorphoses -- Local cuts -- Managing the linear programming problems -- The linear programming solver -- Branching -- Tour finding -- Computation -- The road goes on.
Traveling-salesman problem.