Abo Bibliothek: Guest
Journal of Automation and Information Sciences

Erscheint 12 Ausgaben pro Jahr

ISSN Druckformat: 1064-2315

ISSN Online: 2163-9337

SJR: 0.173 SNIP: 0.588 CiteScore™:: 2

Indexed in

Solution and Investigation of Vector Problems of Combinatorial Optimization on a Set of Polypermutations

Volumen 40, Ausgabe 12, 2008, pp. 27-42
DOI: 10.1615/JAutomatInfScien.v40.i12.30
Get accessGet access

ABSTRAKT

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.

REFERENZIERT VON
  1. 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

  2. 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

  3. 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

Digitales Portal Digitale Bibliothek eBooks Zeitschriften Referenzen und Berichte Forschungssammlungen Preise und Aborichtlinien Begell House Kontakt Language English 中文 Русский Português German French Spain