View in EDS PDF Full Text ePub Full Text

The Traveling Salesman Problem : A Computational Study

Saved in:
Bibliographic Details
Title: The Traveling Salesman Problem : A Computational Study
Description: 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 authors of this book are the same pioneers who for nearly two decades have led the investigation into the traveling salesman problem. They have derived solutions to almost eighty-six thousand cities, yet a general solution to the problem has yet to be discovered. Here they describe the method and computer code they used to solve a broad range of large-scale problems, and along the way they demonstrate the interplay of applied mathematics with increasingly powerful computing platforms. They also give the fascinating history of the problem--how it developed, and why it continues to intrigue us.
Authors: David L. Applegate, Robert E. Bixby, Vašek Chvátal, William J. Cook
Resource Type: eBook.
Subjects: Traveling salesman problem
Categories: MATHEMATICS / Applied
Database: eBook Collection (EBSCOhost)
FullText Links:
  – Type: ebook-pdf
  – Type: ebook-epub
Text:
  Availability: 0
Header DbId: nlebk
DbLabel: eBook Collection (EBSCOhost)
An: 390512
RelevancyScore: 1038
AccessLevel: 6
PubType: eBook
PubTypeId: ebook
PreciseRelevancyScore: 1037.72192382813
IllustrationInfo
ImageInfo – Size: thumb
  Target: https://rps2images.ebscohost.com/rpsweb/othumb?id=NL$390512$PDF&s=r
– Size: medium
  Target: https://rps2images.ebscohost.com/rpsweb/othumb?id=NL$390512$PDF&s=d
Items – Name: Title
  Label: Title
  Group: Ti
  Data: The Traveling Salesman Problem : A Computational Study
– Name: Abstract
  Label: Description
  Group: Ab
  Data: 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 authors of this book are the same pioneers who for nearly two decades have led the investigation into the traveling salesman problem. They have derived solutions to almost eighty-six thousand cities, yet a general solution to the problem has yet to be discovered. Here they describe the method and computer code they used to solve a broad range of large-scale problems, and along the way they demonstrate the interplay of applied mathematics with increasingly powerful computing platforms. They also give the fascinating history of the problem--how it developed, and why it continues to intrigue us.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22David+L%2E+Applegate%22">David L. Applegate</searchLink><br /><searchLink fieldCode="AR" term="%22Robert+E%2E+Bixby%22">Robert E. Bixby</searchLink><br /><searchLink fieldCode="AR" term="%22Vašek+Chvátal%22">Vašek Chvátal</searchLink><br /><searchLink fieldCode="AR" term="%22William+J%2E+Cook%22">William J. Cook</searchLink>
– Name: TypePub
  Label: Resource Type
  Group: TypPub
  Data: eBook.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Traveling+salesman+problem%22">Traveling salesman problem</searchLink>
– Name: SubjectBISAC
  Label: Categories
  Group: Su
  Data: <searchLink fieldCode="ZK" term="%22MATHEMATICS+%2F+Applied%22">MATHEMATICS / Applied</searchLink>
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=nlebk&AN=390512
RecordInfo BibRecord:
  BibEntity:
    Classifications:
      – Code: 511.5
        Scheme: ddc
        Type: prePub
    Languages:
      – Code: eng
        Text: English
    Subjects:
      – SubjectFull: Traveling salesman problem
        Type: general
    Titles:
      – TitleFull: The Traveling Salesman Problem : A Computational Study
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: David L. Applegate
      – PersonEntity:
          Name:
            NameFull: Robert E. Bixby
      – PersonEntity:
          Name:
            NameFull: Vašek Chvátal
      – PersonEntity:
          Name:
            NameFull: William J. Cook
      – PersonEntity:
          Name:
            NameFull: David L. Applegate
      – PersonEntity:
          Name:
            NameFull: Robert E. Bixby
      – PersonEntity:
          Name:
            NameFull: Vašek Chvátal
      – PersonEntity:
          Name:
            NameFull: William J. Cook
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 01
              Type: published
              Y: 2011
            – D: 04
              M: 02
              Type: profile
              Y: 2014
          Identifiers:
            – Type: isbn-print
              Value: 9780691129938
            – Type: isbn-electronic
              Value: 9781400841103
          Titles:
            – TitleFull: The Traveling Salesman Problem : A Computational Study
              Type: main
ResultId 1