Sequential Optimization of Paths in Directed Graphs Relative to Different Cost Functions
Permanent link to this recordhttp://hdl.handle.net/10754/552552
MetadataShow full item record
AbstractThis 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.
CitationSequential Optimization of Paths in Directed Graphs Relative to Different Cost Functions 2011, 4:1272 Procedia Computer Science
JournalProcedia Computer Science
Conference/Event name11th International Conference on Computational Science, ICCS 2011