| Descript |
1 online resource (xiii, 228 pages) : illustrations (some colour), colour maps |
| Content |
text txt |
| Media |
computer c |
| Carrier |
online resource cr |
| Contents |
Challenges. Tour of the United States -- An impossible task? -- One problem at a time -- Road map of the book -- Origins of the problem. Before the mathematicians -- Euler and Hamilton -- Vienna to Harvard to Princeton -- And on to the RAND Corporation -- A statistical view -- 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 -- 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 -- 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 -- Cutting planes. The cutting-plane method -- A catalog of TSP inequalities -- The separation problem -- Edmonds's glimpse of heaven -- Cutting planes for integer programming -- Branching. Breaking up -- The search party -- Branch-and-bound for integer programming -- Big computing. World records -- The TSP on a grand scale -- 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? -- 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. |
| Note |
Unlimited number of concurrent users. UkHlHU |
| ISBN |
9781400839599 (e-book) |
|
1400839599 (e-book) |
|
1283339773 |
|
9781283339773 |
| Standard no. |
9786613339775 |
|
