Abstract: The Travelling Salesman Problem (TSP) asks for the shortest tour that visits each city once and returns to the start. It is a classic NP-hard problem and a benchmark for optimization, ...

Abstract: The paper studies discrete-time statistical filtering problems with the goal to minimize expected total costs. Such problems are usually defined by pairs of stochastic equations and by ...