In Pursuit of the Traveling Salesman
From MaRDI portal
Publication:5891959
DOI10.1515/9781400839599zbMath1301.00021OpenAlexW4253602158MaRDI QIDQ5891959
Publication date: 3 December 2014
Full work available at URL: https://doi.org/10.1515/9781400839599
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) Popularization of mathematics (00A09)
Related Items (2)
Solving large batches of traveling salesman problems with parallel and distributed computing ⋮ Polyhedral techniques in combinatorial optimization: matchings and tours
This page was built for publication: In Pursuit of the Traveling Salesman