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

Handle URI:
http://hdl.handle.net/10754/552552
Title:
Sequential Optimization of Paths in Directed Graphs Relative to Different Cost Functions
Authors:
Abubeker, Jewahir Ali; Chikalov, Igor; Hussain, Shahid ( 0000-0002-1698-2809 ) ; Moshkov, Mikhail ( 0000-0003-0085-9483 )
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.
KAUST Department:
Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
Citation:
Sequential Optimization of Paths in Directed Graphs Relative to Different Cost Functions 2011, 4:1272 Procedia Computer Science
Publisher:
Elsevier BV
Journal:
Procedia Computer Science
Conference/Event name:
11th International Conference on Computational Science, ICCS 2011
Issue Date:
14-May-2011
DOI:
10.1016/j.procs.2011.04.137
Type:
Conference Paper
ISSN:
18770509
Additional Links:
http://linkinghub.elsevier.com/retrieve/pii/S1877050911001955
Appears in Collections:
Conference Papers; Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division

Full metadata record

DC FieldValue Language
dc.contributor.authorAbubeker, Jewahir Alien
dc.contributor.authorChikalov, Igoren
dc.contributor.authorHussain, Shahiden
dc.contributor.authorMoshkov, Mikhailen
dc.date.accessioned2015-05-10T14:33:19Zen
dc.date.available2015-05-10T14:33:19Zen
dc.date.issued2011-05-14en
dc.identifier.citationSequential Optimization of Paths in Directed Graphs Relative to Different Cost Functions 2011, 4:1272 Procedia Computer Scienceen
dc.identifier.issn18770509en
dc.identifier.doi10.1016/j.procs.2011.04.137en
dc.identifier.urihttp://hdl.handle.net/10754/552552en
dc.description.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.en
dc.publisherElsevier BVen
dc.relation.urlhttp://linkinghub.elsevier.com/retrieve/pii/S1877050911001955en
dc.rightsArchived with thanks to Procedia Computer Science. http://creativecommons.org/licenses/by-nc-nd/3.0/en
dc.subjectoptimal pathen
dc.subjectdynamic programmingen
dc.subjectcost functionen
dc.subjectsequential optimizationen
dc.titleSequential Optimization of Paths in Directed Graphs Relative to Different Cost Functionsen
dc.typeConference Paperen
dc.contributor.departmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Divisionen
dc.identifier.journalProcedia Computer Scienceen
dc.conference.date2011-06-01 to 2011-06-03en
dc.conference.name11th International Conference on Computational Science, ICCS 2011en
dc.conference.locationSingapore, SGPen
dc.eprint.versionPublisher's Version/PDFen
kaust.authorChikalov, Igoren
kaust.authorHussain, Shahiden
kaust.authorMoshkov, Mikhailen
kaust.authorAbubeker, Jewahir Alien
All Items in KAUST are protected by copyright, with all rights reserved, unless otherwise indicated.