In Pursuit of the Traveling Salesman

Mathematics at the Limits of Computation

Author: William J. Cook

Publisher: Princeton University Press

ISBN: 0691163529

Category: Mathematics

Page: 248

View: 2281


What is the shortest possible route for a traveling salesman seeking to visit each city on a list exactly once and return to his city of origin? It sounds simple enough, yet the traveling salesman problem is one of the most intensely studied puzzles in applied mathematics—and it has defied solution to this day. In this book, William Cook takes readers on a mathematical excursion, picking up the salesman's trail in the 1800s when Irish mathematician W. R. Hamilton first defined the problem, and venturing to the furthest limits of today’s state-of-the-art attempts to solve it. He also explores its many important applications, from genome sequencing and designing computer processors to arranging music and hunting for planets. In Pursuit of the Traveling Salesman travels to the very threshold of our understanding about the nature of complexity, and challenges you yourself to discover the solution to this captivating mathematical problem.

Limits of Computation

From a Programming Perspective

Author: Bernhard Reus

Publisher: Springer

ISBN: 3319278894

Category: Computers

Page: 348

View: 7217


This textbook discusses the most fundamental and puzzling questions about the foundations of computing. In 23 lecture-sized chapters it provides an exciting tour through the most important results in the field of computability and time complexity, including the Halting Problem, Rice's Theorem, Kleene's Recursion Theorem, the Church-Turing Thesis, Hierarchy Theorems, and Cook-Levin's Theorem. Each chapter contains classroom-tested material, including examples and exercises. Links between adjacent chapters provide a coherent narrative. Fundamental results are explained lucidly by means of programs written in a simple, high-level imperative programming language, which only requires basic mathematical knowledge. Throughout the book, the impact of the presented results on the entire field of computer science is emphasised. Examples range from program analysis to networking, from database programming to popular games and puzzles. Numerous biographical footnotes about the famous scientists who developed the subject are also included. "Limits of Computation" offers a thorough, yet accessible, introduction to computability and complexity for the computer science student of the 21st century.

Finding Augusta

Habits of Mobility and Governance in the Digital Era

Author: Heidi Rae Cooley

Publisher: Dartmouth College Press

ISBN: 1611685222

Category: Social Science

Page: 216

View: 1610


Finding Augusta breaks new ground, revising how media studies interpret the relationship between our bodies and technology. This is a challenging exploration of how, for both good and ill, the sudden ubiquity of mobile devices, GPS systems, haptic technologies, and other forms of media alter individuals' experience of their bodies and shape the social collective. The author succeeds in problematizing the most salient fact of contemporary mobile media technologies, namely, that they have become, like highways and plumbing, an infrastructure that regulates habit. Audacious in its originality, Finding Augusta will be of great interest to art and media scholars alike.

Limits of Computation

An Introduction to the Undecidable and the Intractable

Author: Edna E. Reiter,Clayton Matthew Johnson

Publisher: CRC Press

ISBN: 1439882061

Category: Computers

Page: 279

View: 417


Limits of Computation: An Introduction to the Undecidable and the Intractable offers a gentle introduction to the theory of computational complexity. It explains the difficulties of computation, addressing problems that have no algorithm at all and problems that cannot be solved efficiently. The book enables readers to understand: What does it mean for a problem to be unsolvable or to be NP-complete? What is meant by a computation and what is a general model of a computer? What does it mean for an algorithm to exist and what kinds of problems have no algorithm? What problems have algorithms but the algorithm may take centuries to finish? Developed from the authors’ course on computational complexity theory, the text is suitable for advanced undergraduate and beginning graduate students without a strong background in theoretical computer science. Each chapter presents the fundamentals, examples, complete proofs of theorems, and a wide range of exercises.

Network and Discrete Location

Models, Algorithms, and Applications

Author: Mark S. Daskin

Publisher: John Wiley & Sons

ISBN: 1118536967

Category: Business & Economics

Page: 536

View: 8146


Praise for the First Edition This book is refreshing to read since it takes an important topic... and presents it in a clear and concise manner by using examples that include visual presentations of the problem, solution methods, and results along with an explanation of the mathematical and procedural steps required to model the problem and work through to a solution.” —Journal of Classification Thoroughly updated and revised, Network and Discrete Location: Models, Algorithms, and Applications, Second Edition remains the go-to guide on facility location modeling. The book offers a unique introduction to methodological tools for solving location models and provides insight into when each approach is useful and what information can be obtained. The Second Edition focuses on real-world extensions of the basic models used in locating facilities, including production and distribution systems, location-inventory models, and defender-interdictor problems. A unique taxonomy of location problems and models is also presented. Featuring examples using the author’s own software—SITATION, MOD-DIST, and MENU-OKF—as well as Microsoft Office® Excel®, the book provides: • A theoretical and applied perspective on location models and algorithms • An intuitive presentation of the uses and limits of modeling techniques • An introduction to integrated location-inventory modeling and defender-interdictor models for the design of reliable facility location systems • A full range of exercises to equip readers with an understanding of the basic facility location model types Network and Discrete Location: Models, Algorithms, and Applications, Second Edition is an essential resource for practitioners in applied and discrete mathematics, operations research, industrial engineering, and quantitative geography. The book is also a useful textbook for upper-level undergraduate, graduate, and MBA courses.