"travelling Salesman Problem"

This book provides a literature review of techniques used to pass from continuous to combinatorial space, before discussing a detailed example with individual steps of how cuckoo search (CS) can be adapted to solve combinatorial optimization problems. It demonstrates the application of CS to three different problems and describes their source code. The content is divided into five chapters, the first of which provides a technical description, together with examples of combinatorial search spaces.

Fenwick trees, Caches, Splay Trees, Prefix Trees (Tries), Substring-Search Algorithms and Travelling Salesman Problem

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

A guide to implement data structures, graph algorithms and sorting algorithms from scratch with interview questions!

A guide on Algorithms

A guide to implement data structures, graph algorithms and sorting algorithms from scratch with interview questions!

Fenwick trees, Caches, Splay Trees, Prefix Trees (Tries), Substring-Search Algorithms and Travelling Salesman Problem

Fenwick trees, Caches, Splay Trees, Prefix Trees (Tries), Substring-Search Algorithms and Travelling Salesman Problem

Let's learn Artificial Intelligence search methods: optimization, exact algorithms, heuristics, and metaheuristics

Let's learn Artificial Intelligence search methods: optimization, exact algorithms, heuristics, and metaheuristics.