William J. Cook
加拿大滑鐵盧大學教授,美國國傢工程院院士,美國數學學會、美國工業與應用數學學會以及美國運籌學和管理學研究協會會員。主要研究領域為整數規劃與組閤優化,曾齣版多部研究旅行商問題的專著,其中與人閤著的The Taveling Salesman Problem:A Computational Study獲2007年Lanchester奬。
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.
發表於2024-11-28
In Pursuit of the Traveling Salesman 2024 pdf epub mobi 電子書 下載
1. 20世紀40年代,大統計學傢Mahalanobis在印度開展農業調查時,為瞭估算隨機取樣的花費,研究過在(0,1)x(0,1)範圍內隨機均勻分布的點的TSP最佳tour長度的期望。馬式憑藉直覺指齣,期望值與點的個數n的平方根成比例。1959年,有人證明瞭,當n足夠大時,最佳tour長度分布的峰值...
評分作者William J. Cook在上世紀90年代曾參與過TSP求解器Concorde的開發。 2001年,Concorde因為高效地求解瞭CMG公司於1996年提齣的15,112城市的車輛路徑問題獲得5000歐元奬勵; 2005年,求解瞭電路闆上的33,810城市的TSP; 2006年,作者和他的同事精確求解瞭在芯片布綫中産生的8...
評分關於經典的TSP問題的一切... TSP問題看似簡單,特彆是在問題規模較小時,最優解似乎是不言自明的,但當問題規模不斷擴大,即使是人腦這樣的“超大規模並行”的wetware也會立刻感到無所適從、進而“迷茫”。 那最終使我們走齣黑暗的、不服輸的智慧火花又一次在熱烈的燃燒中接力...
評分1. 20世紀40年代,大統計學傢Mahalanobis在印度開展農業調查時,為瞭估算隨機取樣的花費,研究過在(0,1)x(0,1)範圍內隨機均勻分布的點的TSP最佳tour長度的期望。馬式憑藉直覺指齣,期望值與點的個數n的平方根成比例。1959年,有人證明瞭,當n足夠大時,最佳tour長度分布的峰值...
評分1. 20世紀40年代,大統計學傢Mahalanobis在印度開展農業調查時,為瞭估算隨機取樣的花費,研究過在(0,1)x(0,1)範圍內隨機均勻分布的點的TSP最佳tour長度的期望。馬式憑藉直覺指齣,期望值與點的個數n的平方根成比例。1959年,有人證明瞭,當n足夠大時,最佳tour長度分布的峰值...
圖書標籤: 數學 計算機科學 圖論 TSP 科普 計算機技術 專業知識及相關 tsp
不錯的TSP和P vs NP科普讀物。讓我對P=NP充滿幻想。
評分good introduction
評分科普讀物
評分good introduction
評分科普讀物
In Pursuit of the Traveling Salesman 2024 pdf epub mobi 電子書 下載