• Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Sometimes

Sometimes

Paperback

EconomicsGeneral ComputersGeneral Mathematics

ISBN10: 0989969630
ISBN13: 9780989969635
Publisher: Habitation Of Chimham Pub
Published: Apr 30 2016
Pages: 118
Weight: 0.37
Height: 0.25 Width: 5.98 Depth: 9.02
Language: English
The famous Travelling Salesman Problem is easy to state: given a number of cities on a map, find the shortest path which visits each one and returns to the starting point. It's easy to write a program to solve it, but as the number of cities increases, it quickly becomes impossibly slow, even on modern computers. Why, then, would anyone try solving it hundreds of thousands of times? Maybe if someone did, we might learn something new about this famous problem, or about the even more famous question about P versus NP. Sometimes it's worth doing something foolish like that.

Also in

Economics