When you click on links to various merchants on this site and make a purchase, this can result in this site earning a commission. Affiliate programs and affiliations include, but are not limited to, the eBay Partner Network.
Approximation Algorithms for Traveling Salesman Problems by Vera Traub
- Item No : 167691726351
- Condition : Brand New
- Brand : No brand Info
- Seller : globaldispatchusa
- Current Bid : US $132.00
-
* Item Description
- 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.
★ Recommended Products Related To This Item
♥ Best Selling Products in this category
