Tsp

The Travelling Salesman Problem or the TSP is a representative of a large class of problems known as combinatorial optimization problems. In the ordinary form of the TSP, a map of cities is given to the salesman and he has to visit all the cities only once to complete a tour such that the length of the tour is the shortest among all possible tours for this map. The data consist of weights assigned to the edges of a finite complete graph, and the objective is to find a Hamiltonian cycle, a cycle passing through all the vertices, of the graph while having the minimum total weight. In the TSP context, Hamiltonian cycles are commonly called tours.

Study the Genetic Algorithm, Simulated Annealing, Ant Colony Optimization, Differential Evolution by Coding from Scratch

Some can argue that "Strawberry Fields Forever" is the most important rock song ever written. It is certainly one of the most influential, breaking the boundaries of what a pop song can achieve going past even what The Beatles achieved on Revolver. We have been blessed, going back to the days of vinyl, to have working takes from EMI studios to track the progression of the development of the song. They surfaced on vinyl on Ultra Rare Trax Vol. 1 on Swinging Pig (TSP 001) and have been featured on countless compact disc reissues including Ultra Rare Trax Vol. 1 on The Swingin' Pig (TSP-CD-001), Ultra Rare Trax Vol. 4 on The Swingin' Pig (TSP-CD-026), Unsurpassed Masters Vol. 3 on Yellow Dog (YD003.). In 1999 Vigotone released the John Barrett tapes on Turn Me On Dead Man (VIGO-178/179). In 1997 It's Not Too Bad was released by Pegboy (1008) which revealed twenty additional mintues of "Strawberry Fields Forever" outtakes dating from its initial conception in Spain in 1966 and Lennon's Kenwood home before going into the studio.

Breadth-First Search, Depth-First Search, Shortest Path, Arbitrage, Strongly Connected Components and Maximum Flow