The Traveling Salesman Problem:A Computational Study(Princeton Series in Applied Mathematics)

旅行推销员问题: 计算研究

数学史

售   价:
707.00
发货周期:国外库房发货,通常付款后3-5周到货!
出  版 社
出版时间
2007年02月04日
装      帧
精装
ISBN
9780691129938
复制
页      码
606
开      本
语      种
英文
综合评分
暂无评分
我 要 买
- +
库存 50 本
  • 图书详情
  • 目次
  • 买家须知
  • 书评(0)
  • 权威书评(0)
图书简介
This book presents the latest findings on one of the most intensely investigated subjects in computational mathematics--the traveling salesman problem. It sounds simple enough: given a set of cities and the cost of travel between each pair of them, the problem challenges you to find the cheapest route by which to visit all the cities and return home to where you began. Though seemingly modest, this exercise has inspired studies by mathematicians, chemists, and physicists. Teachers use it in the classroom. It has practical applications in genetics, telecommunications, and neuroscience. The authors of this book are the same pioneers who for nearly two decades have led the investigation into the traveling salesman problem. They have derived solutions to almost eighty-six thousand cities, yet a general solution to the problem has yet to be discovered. Here they describe the method and computer code they used to solve a broad range of large-scale problems, and along the way they demonstrate the interplay of applied mathematics with increasingly powerful computing platforms. They also give the fascinating history of the problem--how it developed, and why it continues to intrigue us.
馆藏图书馆
Princeton University Library
本书暂无推荐
本书暂无推荐
看了又看
  • 上一个
  • 下一个