In pursuit of the traveling salesman mathematics at the limits of computation /

"What is the shortest possible route for a traveling salesman seeking to visit each city on a list exactly once and return to his city of origin? It sounds simple enough, yet the traveling salesman problem is one of the most intensely studied puzzles in applied mathematics--and it has defied so...

Бүрэн тодорхойлолт

-д хадгалсан:
Номзүйн дэлгэрэнгүй
Үндсэн зохиолч: Cook, William, 1957-
Байгууллагын зохиогч: ebrary, Inc
Формат: Цахим Цахим ном
Хэл сонгох:англи
Хэвлэсэн: Princeton : Princeton University Press, 2012.
Нөхцлүүд:
Онлайн хандалт:An electronic book accessible through the World Wide Web; click to view
Шошгууд: Шошго нэмэх
Шошго байхгүй, Энэхүү баримтыг шошголох эхний хүн болох!