In pursuit of the traveling salesman : mathematics at the limits of computation
Item details
- ISBN: 9780691152707 (alk. paper)
- ISBN: 0691152705 (alk. paper)
-
Physical Description:
print
xiii, 228 p. : ill. (chiefly col.), col. maps ; 24 cm. - Publisher: Princeton, N.J. : Princeton University Press, c2012.
Contents / Notes
Bibliography, etc. Note: | Includes bibliographical references (p. [223]-224) and index. |
Formatted Contents Note: | 1. Challenges -- Tour of the United States -- An impossible task? -- One problem at a time -- Road map of the book -- 2. Origins of the problem -- Before the mathematicians -- Euler and Hamilton -- Vienna to Harvard to Princeton -- And on to the RAND Corporation -- A statistical view -- 3. The salesman in action -- Road trips -- Mapping genomes -- Aiming telescopes, x-rays, and lasers -- Guiding industrial machines -- Organizing data -- Tests for microprocessors -- Scheduling jobs -- And more -- 4. Searching for a tour -- The 48-states problem -- Growing trees and tours -- Alterations while you wait -- Borrowing from physics and biology -- The DIMACS challenge -- Tour champions -- 5. Linear programming -- General-purpose model -- The simplex algorithm -- Two for the price of one: LP duality -- The degree LP relaxation of the TSP -- Eliminating subtours -- A perfect relaxation -- Integer programming -- Operations research -- 6. Cutting planes -- The cutting-plane method -- A catalog of TSP inequalities -- The separation problem -- Edmonds's glimpse of heaven -- Cutting planes for integer programming -- 7. Branching -- Breaking up -- The search party -- Branch-and-bound for integer programming -- 8. Big computing -- World records -- The TSP on a grand scale -- 9. Complexity -- A model of computation -- The campaign of Jack Edmonds -- Cook's theorem and Karp's list -- State of the TSP -- Do we need computers? -- 10. The human touch -- Humans versus computers -- Tour-finding strategies -- The TSP in neuroscience -- Animals solving the TSP -- Aesthetics -- Julian Lethbridge -- Jordan curves -- Continuous lines -- Art and mathematics -- Pushing the limits. |
Find similar items by subject
Subject: | Traveling salesman problem Computational complexity |
Currently available copies
- 1 out of 1 copy are currently available at PINES.
Holds
- 0 current holds on 1 total copy.
Show Only Available Copies
Library System: Library Branch Name
|
Call Number / Copy Notes | Barcode | Shelving Location | Status | |
---|---|---|---|---|---|
Clayton County Library System: Forest Park Branch |
511.5 COOK, WILLIAM (
Send Text) |
31012003665666 | STACKS | Available |