In Pursuit of the Traveling Salesman pdf epub mobi txt 电子书下载 2025

简体网页||繁体网页

☆☆☆☆☆

出版者:Princeton University Press

作者:William J. Cook

出品人:

页数:272

译者:

出版时间:2012-1-15

价格:USD 27.95

装帧:Hardcover

isbn号码:9780691152707

丛书系列:

图书标签:

数学
计算机科学
图论
TSP
科普
计算机技术
专业知识及相关
tsp
旅行商问题
优化算法
组合优化
图论
计算机科学
运筹学
数学建模
算法设计
离散数学
人工智能

下载链接在页面底部

facebook linkedin mastodon messenger pinterest reddit telegram twitter viber vkontakte whatsapp 复制链接

想要找书就要到小美书屋

book.quotespace.org

立刻按 ctrl+D收藏本页

你会得到大惊喜!!

具体描述

What is the shortest possible route for a travelling salesman seeking to visit each city on a list exactly once and return to his city of origin? It sounds simple enough, yet the travelling salesman problem is one of the most intensely studied puzzles in applied mathematics - and it has defied solution to this day. In this book, William Cook takes readers on a mathematical excursion, picking up the salesman's trail in the 1800s when Irish mathematician W. R. Hamilton first defined the problem, and venturing to the furthest limits of today's state-of-the-art attempts to solve it. Cook examines the origins and history of the salesman problem and explores its many important applications, from genome sequencing and designing computer processors to arranging music and hunting for planets. He looks at how computers stack up against the travelling salesman problem on a grand scale, and discusses how humans, unaided by computers, go about trying to solve the puzzle. Cook traces the salesman problem to the realms of neuroscience, psychology, and art, and he also challenges readers to tackle the problem themselves. The travelling salesman problem is - literally - a $1 million question. That's the prize the Clay Mathematics Institute is offering to anyone who can solve the problem or prove that it can't be done. "In Pursuit of the Traveling Salesman" travels to the very threshold of our understanding about the nature of complexity, and challenges you yourself to discover the solution to this captivating mathematical problem.

作者简介

William J. Cook

加拿大滑铁卢大学教授，美国国家工程院院士，美国数学学会、美国工业与应用数学学会以及美国运筹学和管理学研究协会会员。主要研究领域为整数规划与组合优化，曾出版多部研究旅行商问题的专著，其中与人合著的The Taveling Salesman Problem：A Computational Study获2007年Lanchester奖。

目录信息

读后感

评分☆☆☆☆☆

1. 20世纪40年代，大统计学家Mahalanobis在印度开展农业调查时，为了估算随机取样的花费，研究过在(0,1)x(0,1)范围内随机均匀分布的点的TSP最佳tour长度的期望。马式凭借直觉指出，期望值与点的个数n的平方根成比例。1959年，有人证明了，当n足够大时，最佳tour长度分布的峰值...

评分☆☆☆☆☆