Computers are good at answering questions. What’s the shortest route from my house to Area 51? Is 8,675,309 a prime number? How many teaspoons in a tablespoon? For questions like these, they’ve got ...

Start working toward program admission and requirements right away. Work you complete in the non-credit experience will transfer to the for-credit experience when you ...

Many important and valuable planning and scheduling problems in logistics and automation are combinatorial optimization problems. The most famous problem of this type is the traveling salesman problem ...

A new approach to solving the ‘Travelling Salesperson Problem’ – one of the most difficult questions in computer science – significantly outperforms current approaches. A notorious theoretical ...

After 44 years, there’s finally a better way to find approximate solutions to the notoriously difficult traveling salesperson problem. When Nathan Klein started graduate school two years ago, his ...

Bumblebees can find the solution to a complex mathematical problem which keeps computers busy for days. Scientists in the UK have discovered that bees learn to fly the shortest possible route between ...

Bumblebees aren’t just hard workers, they’re efficient, too. These insects have a grasp of maths that enables them to crack the classic travelling salesman problem as they forage for pollen and nectar ...