Given a graph whose arc traversal times vary over time, the time-dependent travelling salesman problem (TDTSP) consists in finding a Hamiltonian tour of least total duration covering the vertices of ...

Recognizing that communication between assets may be possible locally but not globally (e.g., due to disruptions to a communication network), Mosaic Warfare requires the movement and operation of ...