Projekt P1 - Levering af pakker

Motion Planning Group Project - Tried to find a shortest watchman route (robot shortest path) by solving the art gallery problem to find the optimal scan locations, and then connected these scan locations by solving the travelling salesman problem

Programs covered in DAA Lab during Semester 4

Python example programs

Program for determining minimal Hamiltonian cycles by dynamic programming (Held-Karp algorithm) and counting algorithm execution time and memory consumption

Projektowanie Efektywnych Algorytmów Projekt Problem Komiwojażera (TSP)

Traveling Salesman Problem - AI homework for college

My work on Travelling Salesman Problem and its approximation algorithms.

Implementation of the Held Bellman Karp (Held-Karp) algorithm for the Travelling Salesman Problem

Dynamic Programming Implementation of Travel Salesman Problem

Maze generation algorithms along with path finding solutions.

Travelling Salesman Problem using Held-Carp algorithm, Nearest neighbour and greedy algorithms.

Brute Force, Branch and bound and Dynamic programming implementation of TSP

Optimal path selection using A* search and Held-Karp algorithm

Compare Held-Karp and Nearest Neighbor solutions to the traveling salesperson problem

This is an implementation of the Held–Karp dynamic programming algorithm for the traveling salesman problem

Traveling Salesman Problem - TSP - Held Karp Exact

Implementation of the Held-Karp algorithm for solving the Travelling Salesman Problem