C*: A New Bounding Approach for the Moving-Target Traveling Salesman Problem

Open in new window