ECOM 031 - Instituto de Computação UFAL
-
Updated
Jun 20, 2023 - C
ECOM 031 - Instituto de Computação UFAL
A project in AI to generate an efficient solution for a TSP(max. 500 nodes). TL: 5 minutes
C program that applies metaheuristic simulated annealing to the Travelling Salesman problem.
This is a bus ticket booking system created using C program 🚌.
Travelling Salesman Problem solved using MPI and DFS
An efficient dynamic programming approach to solve travelling salesman problem
Tarkvara projekt, mille eesmärk on ära lahendada proovireisija ülesanne.
Resolução do problema do caixeiro viajante (Traveling Salesman Problem)
Search and Sorting Algorithms (SSA, a.k.a TBO)
Travelling Salesman Problem solution
Travelling Salesman problem in C
High Performance Computing MPI for Traveling Salesman Problem
Some assignments done during my undergraduate course.
C Program to implement the concept of "Simulated Annealing" to solve the Travelling Salesman Problem.
Applied Genetic Algorithm to solve the Travelling salesman problem, and parallelized it using openmp.
Operational Research 2 - PROJECT
Travelling Salesman Problem utilizando uma MST (Minimum Spanning Tree) - Tópicos de Busca e Ordenação, Ufes.
TSP optimization, Operations Research 2 project, UniPD 2022/23
Add a description, image, and links to the travelling-salesman-problem topic page so that developers can more easily learn about it.
To associate your repository with the travelling-salesman-problem topic, visit your repo's landing page and select "manage topics."