This project implements an approximate solution for the Traveling Salesman Problem (TSP) using classical graph algorithms. The list of cities and their coordinates is loaded from an external XML file ...

This repository contains the code for a solver to the lawn mowing problem. For comparison we have also implemented a well-known approximation algorithm from Arkin, Fekete and Mitchell [1]. The code ...

Machine learning is the ability of a machine to improve its performance based on previous results. Machine learning methods enable computers to learn without being explicitly programmed and have ...

Abstract: The Traveling Salesman Problem (TSP) is a well-known NP-hard combinatorial optimization problem with applications in logistics, transportation, and network design. Traditional approaches, ...

Abstract: The Quantum Approximate Optimization Algorithm (QAOA) is one of the most advanced comparative approaches to solve NP-hard problems on Noisy Intermediate-Scale Quantum (NISQ) computers.