Fork of the Concorde TSP solver with an easier build procedure

A Travelling Salesman Problem solver written in C implementing Genetic Algorithms.

Contains all answers for Rajalakshmi college's Digial cafe CS19341-Design and Analysis of Algorithms. HAPPY CODING !!!

The travelling salesman problem (TSP) asks the following question: Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city exactly once and returns to the origin city?

Projekt P1 - Levering af pakker

clab - Creative Programming Solutions using C - Programming is enjoyable when applied to solve interesting problems (may not be directly used in general day-to-day professional work). The learning and knowledge acquired in the process make a better programmer.

This repository lists 4 problems solved using C. Each problem has its own serial and parallel implementations. For the latter, the OpenMP API was utilized.

Parallel genetic algorithm for solving the travelling salesman problem.

TSP optimization, Operations Research 2 project, UniPD 2022/23

Travelling Salesman Problem solved using Genetic Algorithm

This directory is for the purposes of finding the shortest hamiltonian path given a set of vertices and edges connecting them. It will handle an error if not given the proper format of veritces, edges, and names.

Implementation of the Biogeography-Based Optimization (BBO) algorithm to solve the Traveling Salesman Problem (TSP)

Travelling Salesman Problem solution

Travelling Salesman Problem utilizando uma MST (Minimum Spanning Tree) - Tópicos de Busca e Ordenação, Ufes.

Implementation of some basic Machine Learning algorithms in C using OpenMP for parallel programming

High Performance Computing MPI for Traveling Salesman Problem

This repository lists 4 problems solved using C. Each problem has its own serial and parallel implementations. For the latter, the OpenMP API was utilized.

ECOM 031 - Instituto de Computação UFAL

Operational Research 2 - PROJECT

Resolution of the Traveling Salesman Problem using Backtracking.