SKU/Artículo: AMZ-1009445413
Approximation Algorithms for Traveling Salesman Problems
Format:
Hardcover
Detalles del producto
Disponibilidad:
En stock
En stock
Peso con empaque:
0.77 kg
0.77 kg
Devolución:
No
No
Condición
Nuevo
Nuevo
Producto de:
Amazon
Amazon
Viaja desde
USA
USA
Sobre este producto
- The Traveling Salesman Problem (TSP) is a central topic in discrete mathematics and theoretical computer science. It has been one of the driving forces in combinatorial optimization. The design and analysis of better and better approximation algorithms for the TSP has proved challenging but very fruitful. This is the first book on approximation algorithms for the TSP, featuring a comprehensive collection of all major results and an overview of the most intriguing open problems. Many of the presented results have been discovered only recently, and some are published here for the first time, including better approximation algorithms for the asymmetric TSP and its path version. This book constitutes and advances the state of the art and makes it accessible to a wider audience. Featuring detailed proofs, over 170 exercises, and 100 color figures, this book is an excellent resource for teaching, self-study, and further research.
AR$463.817
31% OFF
AR$319.876
IMPORT EASILY
By purchasing this product you can deduct VAT with your RUT number
AR$463.817
31% OFF
AR$319.876
Pagá fácil y rápido con Mercado Pago o MODO
Llega en 18 a 28 días hábiles
con envío
Tienes garantía de entrega
Este producto viaja
de USA ![]()
a tus manos en
![]()
a tus manos en
Compra protegida
Disfruta de una experiencia de compra segura y confiable
Tarjetas de Crédito y Débito
Visa
Mastercard
American Express
Pagos a través de PayPal
Compra procesada en dólares con dinero en cuenta o tarjetas internacionales.
Paypal
Pagos a través de MODO
Compra procesada en pesos desde la App de tu banco.
PayPal
