Polyhedral results and a branch-and-cut algorithm for the double traveling Salesman problem with multiple stacks