The Non-Stop Disjoint Trajectories Problem

Given an undirected network with traversal times on its edges and connection requests from sources to destinations for commodities with release dates. The non-stop disjoint trajectories problem is to find trajectories that fulfill all requests, such that the commodities never meet. In this extension to the \NP-complete disjoint paths problem, trajectories must satisfy a non-stop … Read more