Sequential Optimization of Paths in Directed Graphs Relative to Different Cost Functions

Jewahir Ali Abubeker, Igor Chikalov, Shahid Hussain, Mikhail Moshkov

Research output: Chapter in Book/Report/Conference proceedingConference contribution

7 Scopus citations

Abstract

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.
Original languageEnglish (US)
Title of host publicationProcedia Computer Science
PublisherElsevier BV
Pages1272-1277
Number of pages6
DOIs
StatePublished - May 22 2011

Fingerprint Dive into the research topics of 'Sequential Optimization of Paths in Directed Graphs Relative to Different Cost Functions'. Together they form a unique fingerprint.

Cite this