Coverart for item
The Resource The Traveling Salesman Problem : a Computational Study

The Traveling Salesman Problem : a Computational Study

Label
The Traveling Salesman Problem : a Computational Study
Title
The Traveling Salesman Problem
Title remainder
a Computational Study
Creator
Contributor
Subject
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
Member of
Cataloging source
EBLCP
Index
no index present
Language note
In English
Literary form
non fiction
Nature of contents
dictionaries
Series statement
Princeton Series in Applied Mathematics
The Traveling Salesman Problem : a Computational Study
Label
The Traveling Salesman Problem : a Computational Study
Link
http://www.jstor.org/stable/10.2307/j.ctt7s8xg
Publication
Related Contributor
Related Location
Related Agents
Related Authorities
Related Subjects
Related Items
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
http://library.link/vocab/cover_art
https://contentcafe2.btol.com/ContentCafe/Jacket.aspx?Return=1&Type=S&Value=9781283256117&userID=ebsco-test&password=ebsco-test
Dimensions
unknown
http://library.link/vocab/discovery_link
{'f': 'http://opac.lib.rpi.edu/record=b4326928'}
Extent
1 online resource (606 pages)
Form of item
online
Isbn
9781283256117
Media category
computer
Media MARC source
rdamedia
Media type code
c
Specific material designation
remote

Library Locations

    • Folsom LibraryBorrow it
      110 8th St, Troy, NY, 12180, US
      42.729766 -73.682577
Processing Feedback ...