Solution to the Traveling Salesman Problem using a greedy branch-and-bound inclusion-exclusion algorithm.
- Cameron Hall
- Arthur Wuterich
There are two implementations included:
- Serial: Adaptation of the algorithm from TSP Solver Generator to execute command line.
- Parallel: Extension of the serial version to adopt OpenMP constructs to make useage of parallel resources.
- Both the serial and parallel version had a python driver in the root of the folder to demonstrate their performance.
- To generate new example cost matrices use the gentable.py program in the python folder
Sonoma State University: CS425-HW6
Fall 2015
Professor Riviore
#Resources