Join Amazon Prime and ship Two-Day for free and Overnight for $3.99. Already a member? Sign in.
Frequently Bought Together
Editorial Reviews
Product Description
Provides an in-depth treatment of the Traveling Salesman problem--the archetypical problem in combinatorial optimization. Each chapter deals with a different aspect of the problem, and has been written by an acknowledged expert in the field. Focusses on the essential ideas in a self-contained manner. Includes exercises and an extensive bibliography.
From the Publisher
Provides an in-depth treatment of the Traveling Salesman problem--the archetypical problem in combinatorial optimization. Each chapter deals with a different aspect of the problem, and has been written by an acknowledged expert in the field. Focusses on the essential ideas in a self-contained manner. Includes exercises and an extensive bibliography.
Provides an in-depth treatment of the Traveling Salesman problem--the archetypical problem in combinatorial optimization. Each chapter deals with a different aspect of the problem, and has been written by an acknowledged expert in the field. Focusses on the essential ideas in a self-contained manner. Includes exercises and an extensive bibliography.
From the Publisher
Provides an in-depth treatment of the Traveling Salesman problem--the archetypical problem in combinatorial optimization. Each chapter deals with a different aspect of the problem, and has been written by an acknowledged expert in the field. Focusses on the essential ideas in a self-contained manner. Includes exercises and an extensive bibliography.
Product Details
Would you like to update product info or give feedback on images?
|
Inside This Book
(learn more)
First Sentence:
If a salesman, starting from his home city, is to visit exactly once each city on a given list and then return home, it is plausible for him to select the order in which he visits the cities so that the total of the distances traveled in his tour is as small as possible. Read the first page Key Phrases - Statistically Improbable Phrases (SIPs): (learn more)
initial subtour, clique tree inequalities, shrinking heuristic, symmetric travelling salesman problem, subtour elimination constraints, farthest insertion procedure, patching algorithm, current subtour, pyramidal tour, graded matrices, tour improvement procedures, subtour elimination inequalities, tour construction procedures, comb problem, violated comb, comb inequalities, spine graph, optimal tour, patching cost, randomly chosen graph, comb inequality, cutting wallpaper, cheapest insertion, generalized assignment problem, traveling salesman polytopes Key Phrases - Capitalized Phrases (CAPs): (learn more)
Prove Lemma, Rinnooy Kan, John Wiley, Proof Let, Sons Ltd, The Traveling Salesman Problem Edited, Proof Left, Proof Suppose, Prove Theorem, Repeat Steps, Van Der Cruyssen, Length Ratio, Merrill Flood New!
Books on Related Topics | Concordance | Text Stats Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Back Cover | Surprise Me!
If a salesman, starting from his home city, is to visit exactly once each city on a given list and then return home, it is plausible for him to select the order in which he visits the cities so that the total of the distances traveled in his tour is as small as possible. Read the first page Key Phrases - Statistically Improbable Phrases (SIPs): (learn more)
initial subtour, clique tree inequalities, shrinking heuristic, symmetric travelling salesman problem, subtour elimination constraints, farthest insertion procedure, patching algorithm, current subtour, pyramidal tour, graded matrices, tour improvement procedures, subtour elimination inequalities, tour construction procedures, comb problem, violated comb, comb inequalities, spine graph, optimal tour, patching cost, randomly chosen graph, comb inequality, cutting wallpaper, cheapest insertion, generalized assignment problem, traveling salesman polytopes Key Phrases - Capitalized Phrases (CAPs): (learn more)
Prove Lemma, Rinnooy Kan, John Wiley, Proof Let, Sons Ltd, The Traveling Salesman Problem Edited, Proof Left, Proof Suppose, Prove Theorem, Repeat Steps, Van Der Cruyssen, Length Ratio, Merrill Flood New!
Books on Related Topics | Concordance | Text Stats Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Back Cover | Surprise Me!
Citations (learn more)
This book cites 42
books:
See all 42 books this book cites
73
books
cite this book:
See all 73 books citing this book
- Combinatorial Optimization: Annotated Bibliographies by M. O'Heigeartaigh on 4 pages
- Integer Programming (Decision & Control) by R. Garfinkel in Front Matter, and Back Matter
- Combinatorial Theory (Wiley Classics Library) by Marshall Hall in Front Matter, and Back Matter
- Convex Analysis (Princeton Landmarks in Mathematics and Physics) by Ralph Tyrell Rockafellar in Back Matter
- Integer and Combinatorial Optimization by Laurence A. Wolsey in Front Matter
See all 42 books this book cites
- Handbook of Transportation Science (International Series in Operations Research & Management Science) by Randolph W. Hall on page 358, page 431, and page 432
- Integer Programming and Network Models by H.A. Eiselt in Back Matter (1), Back Matter (2), and Back Matter (3)
- Computational Combinatorial Optimization: Optimal or Provably Near-Optimal Solutions (Lecture Notes in Computer Science) by Michael Jünger on page 257, and page 259
- Linear Optimization and Extensions (Algorithms and Combinatorics) by Manfred Padberg in Back Matter (1), and Back Matter (2)
- Deterministic Scheduling Theory by R. Gary Parker on page 75, and Back Matter
See all 73 books citing this book
Books on Related Topics
(learn more)
|
What Do Customers Ultimately Buy After Viewing This Item?
 |
78% buy The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics) $39.82 |
 |
22% buy the item featured on this page: The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization (Wiley Series in Discrete Mathematics & Optimization) $348.00 |
Suggested Tags from Similar Products(What's this?)Be the first one to add a relevant tag (keyword that's strongly related to this product).
|
Help others find this product — tag it for Amazon search
No one has tagged this product for Amazon search yet. Why not be the first to suggest a search for which it should appear?
Sell a Digital Version of This Book in the Kindle Store
If you are a publisher or author and hold the digital rights to a book, you can sell a digital version of it in our Kindle Store.
Learn more
Customer Reviews
|
Share your thoughts with other customers:
|
||||||||||||||||||||||
Most Helpful Customer Reviews
Share your thoughts with other customers: Create your own review
|
|
Customer Discussions
Beta (What's this?)
New! See all customer communities, and bookmark your communities to keep track of them.
|
This product's forum
(0 discussions)
Ask questions, Share opinions, Gain insight
Active discussions in related forums
|
||||||||||||||||||||||||||||||||||||||||||
Product Information from the Amapedia Community
Beta (What's this?)Be the first person to add an article about this item at Amapedia.com.
› See featured Amapedia.com articles
Listmania!
So You'd Like to...
|
|
Look for Similar Items by Category
- Books > Computers & Internet > Software > Word Processors & Editors
- Books > New & Used Textbooks > Computer Science
- Books > New & Used Textbooks > Science & Mathematics > Mathematics
- Books > Professional & Technical > Professional Science > Mathematics
- Books > Science > Mathematics > Pure Mathematics > Combinatorics
Summer Sales |
Best Books of 2008 |
Buy Three Books, Get a Fourth Free |
No X-Ray Vision Needed |
|||||||
|
Your Recent History
(What's this?)|
You have no recently viewed items or searches.
After viewing product detail pages or search results, look here to find an easy way to navigate back to pages you are interested in. Look to the right column to find helpful suggestions for your shopping session. |
Continue shopping: Top Sellers
| ||||
| ||
| ||
| ||
| ||
| ||
