The Resource The Traveling Salesman Problem : a Computational Study
The Traveling Salesman Problem : a Computational Study
Resource Information
The item The Traveling Salesman Problem : a Computational Study represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Missouri-St. Louis Libraries.This item is available to borrow from 1 library branch.
Resource Information
The item The Traveling Salesman Problem : a Computational Study represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Missouri-St. Louis Libraries.
This item is available to borrow from 1 library branch.
- Summary
- This book presents the latest findings on one of the most intensely investigated subjects in computational mathematics--the traveling salesman problem. It sounds simple enough: given a set of cities and the cost of travel between each pair of them, the problem challenges you to find the cheapest route by which to visit all the cities and return home to where you began. Though seemingly modest, this exercise has inspired studies by mathematicians, chemists, and physicists. Teachers use it in the classroom. It has practical applications in genetics, telecommunications, and neuroscience. The autho
- Language
- eng
- Extent
- 1 online resource (606 pages)
- Contents
-
- Chapter 6. Subtour Cuts and PQ-Trees
- Chapter 7. Cuts from Blossoms and Blocks
- Chapter 8. Combs from Consecutive Ones
- Chapter 9. Combs from Dominoes
- Chapter 10. Cut Metamorphoses
- Chapter 11. Local Cuts
- Chapter 12. Managing the Linear Programming Problems
- Chapter 13. The Linear Programming Solver Chapter 14. Branching
- Chapter 14. Branching
- Chapter 15. Tour Finding
- Frontmatter
- Chapter 16. Computation
- Chapter 17. The Road Goes On
- Bibliography
- Index
- Contents
- Preface
- Chapter 1. The Problem
- Chapter 2. Applications
- Chapter 3. Dantzig, Fulkerson, and Johnson
- Chapter 4. History of TSP Computation
- Chapter 5. LP Bounds and Cutting Planes
- Isbn
- 9781283256117
- Label
- The Traveling Salesman Problem : a Computational Study
- Title
- The Traveling Salesman Problem
- Title remainder
- a Computational Study
- Language
- eng
- Summary
- This book presents the latest findings on one of the most intensely investigated subjects in computational mathematics--the traveling salesman problem. It sounds simple enough: given a set of cities and the cost of travel between each pair of them, the problem challenges you to find the cheapest route by which to visit all the cities and return home to where you began. Though seemingly modest, this exercise has inspired studies by mathematicians, chemists, and physicists. Teachers use it in the classroom. It has practical applications in genetics, telecommunications, and neuroscience. The autho
- Cataloging source
- EBLCP
- http://library.link/vocab/creatorName
- Applegate, David L
- Dewey number
- 511/.5
- Index
- no index present
- Language note
- In English
- LC call number
- QA164 .T72 2011
- Literary form
- non fiction
- Nature of contents
- dictionaries
- http://library.link/vocab/relatedWorkOrContributorName
-
- Bixby, Robert E
- Chvatal, Vasek
- Cook, William J
- Series statement
- Princeton Series in Applied Mathematics
- http://library.link/vocab/subjectName
-
- Traveling salesman problem
- MATHEMATICS
- MATHEMATICS
- Traveling salesman problem
- Label
- The Traveling Salesman Problem : a Computational Study
- Carrier category
- online resource
- Carrier category code
-
- cr
- Carrier MARC source
- rdacarrier
- Content category
- text
- Content type code
-
- txt
- Content type MARC source
- rdacontent
- Contents
-
- Chapter 6. Subtour Cuts and PQ-Trees
- Chapter 7. Cuts from Blossoms and Blocks
- Chapter 8. Combs from Consecutive Ones
- Chapter 9. Combs from Dominoes
- Chapter 10. Cut Metamorphoses
- Chapter 11. Local Cuts
- Chapter 12. Managing the Linear Programming Problems
- Chapter 13. The Linear Programming Solver Chapter 14. Branching
- Chapter 14. Branching
- Chapter 15. Tour Finding
- Frontmatter
- Chapter 16. Computation
- Chapter 17. The Road Goes On
- Bibliography
- Index
- Contents
- Preface
- Chapter 1. The Problem
- Chapter 2. Applications
- Chapter 3. Dantzig, Fulkerson, and Johnson
- Chapter 4. History of TSP Computation
- Chapter 5. LP Bounds and Cutting Planes
- Control code
- 749265038
- Dimensions
- unknown
- Extent
- 1 online resource (606 pages)
- Form of item
- online
- Isbn
- 9781283256117
- Media category
- computer
- Media MARC source
- rdamedia
- Media type code
-
- c
- Other control number
- 10.1515/9781400841103
- http://library.link/vocab/ext/overdrive/overdriveId
- 22573/cttx1kn
- Specific material designation
- remote
- System control number
- (OCoLC)749265038
- Label
- The Traveling Salesman Problem : a Computational Study
- Carrier category
- online resource
- Carrier category code
-
- cr
- Carrier MARC source
- rdacarrier
- Content category
- text
- Content type code
-
- txt
- Content type MARC source
- rdacontent
- Contents
-
- Chapter 6. Subtour Cuts and PQ-Trees
- Chapter 7. Cuts from Blossoms and Blocks
- Chapter 8. Combs from Consecutive Ones
- Chapter 9. Combs from Dominoes
- Chapter 10. Cut Metamorphoses
- Chapter 11. Local Cuts
- Chapter 12. Managing the Linear Programming Problems
- Chapter 13. The Linear Programming Solver Chapter 14. Branching
- Chapter 14. Branching
- Chapter 15. Tour Finding
- Frontmatter
- Chapter 16. Computation
- Chapter 17. The Road Goes On
- Bibliography
- Index
- Contents
- Preface
- Chapter 1. The Problem
- Chapter 2. Applications
- Chapter 3. Dantzig, Fulkerson, and Johnson
- Chapter 4. History of TSP Computation
- Chapter 5. LP Bounds and Cutting Planes
- Control code
- 749265038
- Dimensions
- unknown
- Extent
- 1 online resource (606 pages)
- Form of item
- online
- Isbn
- 9781283256117
- Media category
- computer
- Media MARC source
- rdamedia
- Media type code
-
- c
- Other control number
- 10.1515/9781400841103
- http://library.link/vocab/ext/overdrive/overdriveId
- 22573/cttx1kn
- Specific material designation
- remote
- System control number
- (OCoLC)749265038
Library Links
Embed
Settings
Select options that apply then copy and paste the RDF/HTML data fragment to include in your application
Embed this data in a secure (HTTPS) page:
Layout options:
Include data citation:
<div class="citation" vocab="http://schema.org/"><i class="fa fa-external-link-square fa-fw"></i> Data from <span resource="http://link.umsl.edu/portal/The-Traveling-Salesman-Problem--a-Computational/pi8JaNzyOCo/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.umsl.edu/portal/The-Traveling-Salesman-Problem--a-Computational/pi8JaNzyOCo/">The Traveling Salesman Problem : a Computational Study</a></span> - <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.umsl.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.umsl.edu/">University of Missouri-St. Louis Libraries</a></span></span></span></span></div>
Note: Adjust the width and height settings defined in the RDF/HTML code fragment to best match your requirements
Preview
Cite Data - Experimental
Data Citation of the Item The Traveling Salesman Problem : a Computational Study
Copy and paste the following RDF/HTML data fragment to cite this resource
<div class="citation" vocab="http://schema.org/"><i class="fa fa-external-link-square fa-fw"></i> Data from <span resource="http://link.umsl.edu/portal/The-Traveling-Salesman-Problem--a-Computational/pi8JaNzyOCo/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.umsl.edu/portal/The-Traveling-Salesman-Problem--a-Computational/pi8JaNzyOCo/">The Traveling Salesman Problem : a Computational Study</a></span> - <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.umsl.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.umsl.edu/">University of Missouri-St. Louis Libraries</a></span></span></span></span></div>
