*Why is the annual Father Christmas world tour ‘NP-Complete’? What is ‘NP-Complete’ anyway? In fact, what’s ‘NP’ even? And why can only Santa do it? And what’s a ‘Decision Elf’? * 2,805 more words

## Tags » Travelling Salesman Problem

#### The Travelling Santa Problem

#### A Flawed Research on a TSP Algorithm

A Travelling Salesman Problem (TSP) is a well known computational challenge. A lot of algorithms were developed to solve it or its special cases.

I came around an article authored by Fang Liu ‘A dual population parallel ant colony optimization algorithm for solving the travelling salesman problem’. 366 more words

#### The Trompe-l'œil Menorah

Hanukkah decorations have been up in stores since before Halloween, and that means it’s time for electronic Menorahs with blinking LEDs, controllers, and if you’re really good, a real-time clock with support for the Jewish calendar. 169 more words

#### The Travelling Salesman Problem (Exhaustive Approach)

For those of you who don’t know what this problem is about, here is the problem statement:

*You are given a list of cities and the distances between all connected cities.* 351 more words