48StatesProject.com MAP
"...travel through all of the lower 48 states in one year's time"
by Jonathan “J.” Tower
podcast interview: Yet Another Podcast – Show 140: J. Tower | Jesse Liberty
The Definitive Road Trip? It's Data-Driven : NPR
"Randy Olson, a Ph.D. candidate at Michigan State University and a self-proclaimed "data tinkerer," believes he's devised a route that could allow a family to hit a landmark in each of the Lower 48 states...
Travelling salesman problem - Wikipedia, the free encyclopedia
"The travelling salesman problem (TSP) asks the following question: Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city exactly once and returns to the origin city? It is an NP-hard problem in combinatorial optimization, important in operations research and theoretical computer science."
"Randy Olson, a Ph.D. candidate at Michigan State University and a self-proclaimed "data tinkerer," believes he's devised a route that could allow a family to hit a landmark in each of the Lower 48 states...
Travelling salesman problem - Wikipedia, the free encyclopedia
"The travelling salesman problem (TSP) asks the following question: Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city exactly once and returns to the origin city? It is an NP-hard problem in combinatorial optimization, important in operations research and theoretical computer science."
No comments:
Post a Comment