An edition of The Traveling salesman problem
(1985)
The Traveling Salesman Problem
A Guided Tour of Combinatorial Optimization (Wiley Series in Discrete Mathematics & Optimization)
by Eugene L. Lawler, E. L. Lawler, Jan Karel Lenstra, A. H. G. Rinnooy Kan, and D. B. Shmoys
- 1 Want to read
- 1 Have read
Share
×Close
This work doesn't have a description yet. Can you add one?
Check nearby libraries
Buy this book
Previews available in: English
| Edition | Availability |
|---|---|
1
The Traveling salesman problem: a guided tour of combinatorial optimization
1990, Wiley
in English
0471904139 9780471904137
|
zzzz
|
2
The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization (Wiley Series in Discrete Mathematics & Optimization)
September 1985, Wiley
in English
0471904139 9780471904137
|
aaaa
|
Book Details
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."
Edition Identifiers
Work Identifiers
Community Reviews (0)
| December 11, 2022 | Edited by MARC Bot | import existing book |
| September 29, 2021 | Edited by ImportBot | import existing book |
| July 31, 2019 | Edited by MARC Bot | associate edition with work OL18421744W |
| July 7, 2019 | Edited by MARC Bot | import existing book |
| February 6, 2019 | Created by MARC Bot | import existing book |