Show simple item record

dc.contributor.authorAbubeker, Jewahir Ali
dc.contributor.authorChikalov, Igor
dc.contributor.authorHussain, Shahid
dc.contributor.authorMoshkov, Mikhail
dc.date.accessioned2015-05-10T14:33:19Z
dc.date.available2015-05-10T14:33:19Z
dc.date.issued2011-05-14
dc.identifier.citationSequential Optimization of Paths in Directed Graphs Relative to Different Cost Functions 2011, 4:1272 Procedia Computer Science
dc.identifier.issn18770509
dc.identifier.doi10.1016/j.procs.2011.04.137
dc.identifier.urihttp://hdl.handle.net/10754/552552
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.
dc.publisherElsevier BV
dc.relation.urlhttp://linkinghub.elsevier.com/retrieve/pii/S1877050911001955
dc.rightsArchived with thanks to Procedia Computer Science. http://creativecommons.org/licenses/by-nc-nd/3.0/
dc.subjectoptimal path
dc.subjectdynamic programming
dc.subjectcost function
dc.subjectsequential optimization
dc.titleSequential Optimization of Paths in Directed Graphs Relative to Different Cost Functions
dc.typeConference Paper
dc.contributor.departmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
dc.identifier.journalProcedia Computer Science
dc.conference.date2011-06-01 to 2011-06-03
dc.conference.name11th International Conference on Computational Science, ICCS 2011
dc.conference.locationSingapore, SGP
dc.eprint.versionPublisher's Version/PDF
kaust.personChikalov, Igor
kaust.personHussain, Shahid
kaust.personMoshkov, Mikhail
kaust.personAbubeker, Jewahir Ali
refterms.dateFOA2018-06-13T11:31:53Z


Files in this item

Thumbnail
Name:
1-s2.0-S1877050911001955-main.pdf
Size:
141.2Kb
Format:
PDF
Description:
Main article

This item appears in the following Collection(s)

Show simple item record