A LP-based heuristic for a time-constrained routing problem