Sequential Optimization of Paths in Directed Graphs Relative to Different Cost Functions
Jewahir AbuBekr, Igor Chikalov, Shahid Hussain, Mikhail Moshkov · Procedia Computer Science · 2011
This paper is devoted to the consideration of an algorithm for sequential optimization of paths in directed graphs relative to di_erent cost functions. The considered algorithm is based on an extension of dynamic programming which allows to represent the initial set of paths and the set of optimal paths after each application of optimization procedure in the form of a directed acyclic graph.