magmine/TSP_branchandbound

This is an implementation of the Branch and Bound algorithm to solve a simplified version of the Travelling sales man problem where the graph is complete

Java