Integar Linear Programming Formulations For The Sparse Travelling Salesman Problem