Publicou 12 edições por ano
ISSN Imprimir: 1064-2315
ISSN On-line: 2163-9337
Indexed in
Solution and Investigation of Vector Problems of Combinatorial Optimization on a Set of Polypermutations
RESUMO
We investigated complicated vector problems on combinatorial set of polypermutations. Some properties of accessible region of the combinatorial multicriterion problem, which is solved in arithmetic Euclidian space, were studied. We obtained necessary and sufficient conditions of optimality of different types of efficient solutions. The method for search of Pareto-optimal solutions of the considered class of problems was constructed.
-
Semenova N. V., Kolechkina L. N., A polyhedral approach to solving multicriterion combinatorial optimization problems over sets of polyarrangements, Cybernetics and Systems Analysis, 45, 3, 2009. Crossref
-
Semenova N. V., Kolechkina L. N., Nagirna A. M., Vector optimization problems with linear criteria over a fuzzy combinatorial set of alternatives, Cybernetics and Systems Analysis, 47, 2, 2011. Crossref
-
Koliechkina L. N., Dvirna O. A., Khovben S. V., A Two-Step Method for Solving Vector Optimization Problems on Permutation Configuration, Cybernetics and Systems Analysis, 57, 3, 2021. Crossref