Show simple item record

dc.contributor.authorMankowski, Michal
dc.contributor.authorMoshkov, Mikhail
dc.date.accessioned2020-05-03T08:56:11Z
dc.date.available2020-05-03T08:56:11Z
dc.date.issued2020-04-29
dc.date.submitted2019-10-02
dc.identifier.citationMankowski, M., & Moshkov, M. (2020). Dynamic programming bi-criteria combinatorial optimization. Discrete Applied Mathematics. doi:10.1016/j.dam.2020.04.016
dc.identifier.issn0166-218X
dc.identifier.doi10.1016/j.dam.2020.04.016
dc.identifier.urihttp://hdl.handle.net/10754/662698
dc.description.abstractWe introduce a model for combinatorial optimization problems based on the notion of a circuit. This circuit builds a set of elements for optimization from one-element sets attached to input nodes. It uses the operation of union of sets and functional operations on elements extended to sets of elements. We design a dynamic programming algorithm based on this circuit which constructs the set of Pareto optimal points for the problem of bi-criteria optimization of elements described by the circuit relative to two cost functions. We tested this approach on nine known combinatorial optimization problems. The problems related to the matrix chain multiplication, optimal paths in directed graphs, and binary search trees are considered in detail.
dc.description.sponsorshipResearch reported in this publication was supported by King Abdullah University of Science and Technology (KAUST), Kingdom of Saudi Arabia . We are greatly indebted to the anonymous reviewers for useful comments and suggestions.
dc.publisherElsevier BV
dc.relation.urlhttps://linkinghub.elsevier.com/retrieve/pii/S0166218X20301864
dc.rightsNOTICE: this is the author’s version of a work that was accepted for publication in Discrete Applied Mathematics. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in Discrete Applied Mathematics, [, , (2020-04-29)] DOI: 10.1016/j.dam.2020.04.016 . © 2020. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/
dc.titleDynamic programming bi-criteria combinatorial optimization
dc.typeArticle
dc.contributor.departmentApplied Mathematics and Computational Science Program
dc.contributor.departmentComputer Science Program
dc.contributor.departmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
dc.contributor.departmentExtensions of Dynamic Programming, Machine Learning and Discrete Optimization Research Group
dc.identifier.journalDiscrete Applied Mathematics
dc.rights.embargodate2022-04-29
dc.eprint.versionPost-print
kaust.personMankowski, Michal
kaust.personMoshkov, Mikhail
dc.date.accepted2020-04-09
dc.identifier.eid2-s2.0-85083894361
dc.date.published-online2020-04-29
dc.date.published-print2020-09


Files in this item

Thumbnail
Name:
M_C_O_3.pdf
Size:
2.154Mb
Format:
PDF
Description:
Accepted Manuscript

This item appears in the following Collection(s)

Show simple item record