In Pursuit of the Traveling Salesman: Mathematics at the Limits of Computation
DOI10.1090/NOTI1397zbMath1352.00015OpenAlexW2437506279MaRDI QIDQ2952021
David B. Shmoys, Jan Karel Lenstra
Publication date: 29 December 2016
Published in: Notices of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/noti1397
Abstract computational complexity for mathematical programming problems (90C60) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) External book reviews (00A17) Popularization of mathematics (00A09)
This page was built for publication: In Pursuit of the Traveling Salesman: Mathematics at the Limits of Computation
