Sign in
Back
Sequential Optimization of Paths in Directed Graphs Relative to Different Cost Functions
Conference proceeding   Open access  Peer reviewed

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

Jewahir AbuBekr, Igor Chikalov, Shahid Hussain and Mikhail Moshkov
PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON COMPUTATIONAL SCIENCE (ICCS), Vol.4, pp.1272-1277
Procedia Computer Science
01/01/2011
DOI: https://doi.org/10.1016/j.procs.2011.04.137

Abstract

Computer Science Computer Science, Theory & Methods Engineering Engineering, Electrical & Electronic Science & Technology Technology
This paper is devoted to the consideration of an algorithm for sequential optimization of paths in directed graphs relative to different 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.
url
https://doi.org/10.1016/j.procs.2011.04.137View
Published (Version of record) Open

Metrics

1 Record Views

Details