imagine you have traveled to an unfamiliar city. before you start your daily tour around the city, you need to know a good route. in network theory (nt), this is the traveling salesman problem (tsp). a dynamic programming algorithm is often used for solving this problem. however, when the road network of the city is very complicated and dense, which is usually the case, it will take too long fo...

Imagine you have traveled to an unfamiliar city. Before you start your daily tour around the city, you need to know a good route. In Network Theory (NT), this is the traveling salesman problem (TSP). A dynamic programming algorithm is often used for solving this problem. However, when the road network of the city is very complicated and dense, which is usually the case, it will take too long fo...

Rats were repeatedly exposed to an open arena containing two depletable food sources in a discrete-trials procedure. Their movement patterns were recorded and compared to adaptive foraging tactics such as minimizing distance or energy expenditure, thigmotaxis, and trail following. They were also compared to the predictions of the associative route-finder model of Reid and Staddon [Reid, A.K., S...