О полных и квазиполных двухкритериальных задачах на графах / Перепелица В. А., Терещенко Э. В. (2018)
Ukrainian

English  Cybernetics and Systems Analysis   /     Issue (2018, 54 (3))

Perepelitsa V.A., Tereschenko E.V.
On complete and quasi-complete two-criteria optimization problems on graphs

Sufficient conditions are studied for the presence of the completeness or quasicompleteness property in two-criteria discrete optimization problems with the same and different weight-type criteria. Estimates are computed for the cardinalities of sets of feasible solutions, the Pareto set, and a complete set of alternatives for a number of two-criteria problems. © 2018, Springer Science+Business Media, LLC, part of Springer Nature.

Keywords: complete problem, complete set of alternatives, multicriteria optimization, Pareto set, quasi-complete problem, vector optimization, Computer science, Cybernetics, Complete problems, complete set of alternatives, Multicriteria optimization, Pareto set, Vector optimizations, Multiobjective optimization


Cite:
Perepelitsa V.A., Tereschenko E.V. (2018). On complete and quasi-complete two-criteria optimization problems on graphs. Cybernetics and Systems Analysis, 54 (3), 51-57. doi: https://doi.org/10.1007/s10559-018-0040-1 http://jnas.nbuv.gov.ua/article/UJRN-0000863958 [In Russian].


 

Інститут інформаційних технологій НБУВ


+38 (044) 525-36-24
Голосіївський просп., 3, к. 209
м. Київ, 03039, Україна