the traveling salesman problem on NOVA

The PBS show NOVA covered the traveling salesman problem [Link]. Here is a short video from the program. The traveling salesman has trillions and trillions of possible routes than there are stars in the galaxy. And algorithms can search through those options and find near-optimal solutions relatively quickly. I am having trouble embedding the video, so please visit the NOVA video here:

http://video.pbs.org/viralplayer/2365100888

This episode will air TONIGHT on PBS at 9pm EST.

HT Matt Saltzman and Bill Cook.


Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out /  Change )

Google photo

You are commenting using your Google account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )

Connecting to %s

%d bloggers like this: