https://github.com/vishalanandv/high_performance_computing_application

High Performance Computing MPI for Traveling Salesman Problem
https://github.com/vishalanandv/high_performance_computing_application

clanguage high-performance-computing mpi openmpi-cpu-clusters travelling-salesman-problem

Last synced: 2 months ago
JSON representation

High Performance Computing MPI for Traveling Salesman Problem

• Host: GitHub
• URL: https://github.com/vishalanandv/high_performance_computing_application
• Owner: VishalAnandV
• Created: 2023-04-05T15:05:29.000Z (about 2 years ago)
• Default Branch: main
• Last Pushed: 2023-04-05T18:49:35.000Z (about 2 years ago)
• Last Synced: 2025-01-13T14:39:30.588Z (4 months ago)
• Topics: clanguage, high-performance-computing, mpi, openmpi-cpu-clusters, travelling-salesman-problem
• Language: C
• Homepage:
• Size: 6.84 KB
• Stars: 1
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        

## Implementataion of High Performance Computing 

This project focuses on the implementation of a High-Performance Technical Computing solution on an HPC cluster, utilizing MPI to parallelize the travelling salesman problem.

### Structure:

- 'BruteForce' contains the brute force implementation of the Travelling Salesman Problem

- 'Branch_and_Bound' contains the branch and bound implementation of the Travelling Salesman Problem

- 'input' contains the input files for the algorithms from 4 to 18 cities