Contact
Cum să cumpăr
Livrare
Consilier de cumpărături
Traveling Salesman Problem
A Computational Study
engleză
Leftin
&
avantajos ▸
Până la 30 de zile pentru returnare
Clienții au cumpărat de asemenea
/
Carte broșată
123.94
lei
/
Carte broșată
207.83
lei
/
Carte broșată
308.88
lei
/
Audio CD
84.29
lei
This book presents the latest findings on one of the most intensely investigated subjects in computational mathematics - the travelling 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 travelling 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.
Informații despre carte
engleză
Dăruiește această carte chiar astăzi
Este foarte ușor
1 Adaugă cartea în coș și selectează Livrează ca un cadou 2 Îți vom trimite un voucher în schimb 3 Cartea va ajunge direct la adresa destinataruluiAr putea de asemenea, să te intereseze
/
Carte broșată
77.84
lei
/
Carte broșată
52.03
lei
/
Articole de papetărie
60.87
lei
Bună ziua! Sunt Libroamiko, consilierul dumneavoastră de cărți.
Cu ce vă pot ajuta?