Algorithms for solving discrete control problems on networks
The authors consider the discrete optimal problem concerning networks with integral time cost criteria applied to trajectories starting from and ending in known states. The cost functions on the edges of the graph are supposed to be positive and nondecreasing. A polynomial-time algorithm for solving the problem is proposed.
scientific article; zbMATH DE number 1960736