Text this: Lower and upper bounds for a symmetric multiple depot, multiple travelling salesman problem /