Implementation of Branch And Bound for 0/1 Knapsack and Travelling Salesman Problem, parallelized using OpenMP and MPI.
C
Switch branches/tags
Nothing to show
Clone or download
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Failed to load latest commit information.
README.md
bnb_openmp_dataDef.h
bnb_openmp_final.c
howto.txt
makefile
mpiksack2.c

README.md

BranchAndBound

Implementation of Branch And Bound for 0/1 Knapsack and Travelling Salesman Problem, parallelized using OpenMP and MPI.

--Authored by Viraj Prabhu and Utkarsh Verma--