The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization
ISBN-13:
9780471904137
ISBN-10:
0471904139
Edition:
1
Author:
A.H.G. Rinnooy Kan, Jan Karel Lenstra, E. L. Lawler, D. B. Shmoys
Publication date:
1985
Publisher:
John Wiley & Sons Inc
Format:
Hardcover
476 pages
Category:
Data Processing
,
Databases & Big Data
FREE US shipping
Book details
ISBN-13:
9780471904137
ISBN-10:
0471904139
Edition:
1
Author:
A.H.G. Rinnooy Kan, Jan Karel Lenstra, E. L. Lawler, D. B. Shmoys
Publication date:
1985
Publisher:
John Wiley & Sons Inc
Format:
Hardcover
476 pages
Category:
Data Processing
,
Databases & Big Data
Summary
The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization (ISBN-13: 9780471904137 and ISBN-10: 0471904139), written by authors
A.H.G. Rinnooy Kan, Jan Karel Lenstra, E. L. Lawler, D. B. Shmoys, was published by John Wiley & Sons Inc in 1985.
With an overall rating of 4.4 stars, it's a notable title among other
Data Processing
(Databases & Big Data) books. You can easily purchase or rent The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization (Hardcover) from BooksRun,
along with many other new and used
Data Processing
books
and textbooks.
And, if you're looking to sell your copy, our current buyback offer is $0.3.
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.
We would LOVE it if you could help us and other readers by reviewing the book
{user}
{createdAt}
{truncated_title}
{author_block}
by {truncated_author}
