Travelling Repairman Problem

This is an ILP implementation in C++ of a new algorithm for the Traveling Repairman Problem with unit time windows. This produces approximate solutions within a factor of 4 to the optimal solution. This resulted in a IEEE paper and MSc. thesis (2015)