We introduce an integer linear programming formulation for the Traveling Repairman Problem with unit time windows, which produces approximate solutions within a factor of 4 to the optimal solution. We analyze empirically the required time to solve this formulation using a state-of-the-art MIP solver. Finally, we discuss an extension to our approach to windows of arbitrary length.
['Yani Miguel-Pilar', 'Guillermo Morales-Luna', 'Feliu Davino Sagols Troncoso', 'Francisco Javier Zaragoza Martínez']
An ILP approach for the traveling repairman problem with unit time windows