TY - GEN
T1 - Sequential Optimization of Paths in Directed Graphs Relative to Different Cost Functions
AU - Abubeker, Jewahir Ali
AU - Chikalov, Igor
AU - Hussain, Shahid
AU - Moshkov, Mikhail
N1 - KAUST Repository Item: Exported on 2020-10-01
PY - 2011/5/22
Y1 - 2011/5/22
N2 - 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.
AB - 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.
UR - http://hdl.handle.net/10754/552552
UR - http://linkinghub.elsevier.com/retrieve/pii/S1877050911001955
UR - http://www.scopus.com/inward/record.url?scp=79958258543&partnerID=8YFLogxK
U2 - 10.1016/j.procs.2011.04.137
DO - 10.1016/j.procs.2011.04.137
M3 - Conference contribution
SP - 1272
EP - 1277
BT - Procedia Computer Science
PB - Elsevier BV
ER -