I am building an WebApp that takes your photos and turns them into Fourier Epicycle Drawings.

Implementation of various algorithms to solve sTSP: D.P. Held–Karp algorithm, Held–Karp MST algorithm, Volgenant–Jonker 1-tree relaxation, Christofides algorithm. It includes: Kruskal algorithm, Prim algorithm, Blossom algorithm.

A C++ implementation of the Christofides algorithm for instances in TSPLIB format

Competitive C++ solution to the Travelling Salesperson 2D problem, that includes the implementation of 6 algorithms: greedy, Clarke-Wright, Christofides, 2-opt, 3-opt, and Lin-Kernighan (k-opt). Done as part of the project assignment in the *DD22440 Advanced Algorithms* course at KTH, by Prof. Danupon Nanongkai.

Implementation and comparison of two approximation algorithms for the Metric Traveling Salesman Problem (TSP)

Implementación algoritmo de 'Christofides' en problema TSP

This program generates a playlist in a sequence that allows a continuous and uninterrupted listening experience. The goal of this algorithm is to minimize the weight difference between each pair of adjacent tracks in the sequence using Christofides algorithm, an approximate algorithm for solving traveling salesman problem

This application calculates the path a bot should take in order to minimise the distance travelled by it while fetching items from various sections of a warehouse.

Implementations of various combinatorial optimization algorithms, focusing on approximation algorithms for NP-hard problems.

🧳 Solving the Traveling Salesperson Problem with Simulated Annealing, Ant Colony Optimization, and Christofides.

Assignment on the subject of approximation algorithms at class DCC207

Step-by-step python implementation of Christofides Algorithm with Google Maps API

A webapp for comparing travelling salesman's problem algorithms.

The projects models the flightpath of a drone while it makes deliveries. The projects compares different algorithms and their suitability.

Analyse Exploratoire de Données (EDA)

The travelling salesman problem comparing aprox2, christofides, opt2, simulated annealing and tabu search algorithms.

Heuristic methods for solving the Traveling Salesman Problem in Go.

In this project, Christofides Algorithm can be found in several different implementations to achieve approximate solution of Travelling Salesman Problem.

A full-stack algorithm visualization platform developed as a university team project to compare multiple approaches to the Traveling Salesman Problem, including exact, heuristic, approximation, and LLM-generated solutions.