An approach to solving discrete vector optimization problems over a combinatorial set of permutations.

Semenova N. V.
Nagornaya A. N.
Koliechkina L.

Publication date

January 2008

DOI

Publisher

Natsional\cprime naya Akademiya Nauk Ukrainy. Institut Kibernetiki im. V. M. Glushkova. Kibernetika i Sistemny\uı\ Analiz

ISSN

1060-0396

Journal

issn:0023-1274

Citation count (estimate)

Abstract

Complex discrete multicriteria problems over a combinatorial set of permutations are analyzed. Some properties of an admissible domain for a combinatorial multicriteria problem embedded into an arithmetic Euclidian space are considered. Optimality conditions are obtained for different types of effective solutions. A new approach to solving the problems formulated is constructed and substantiated

Extracted data

We use cookies to provide a better user experience.

Data Protection

An approach to solving discrete vector optimization problems over a combinatorial set of permutations.

Abstract

Extracted data

An approach to solving discrete vector optimization problems over a combinatorial set of permutations.

Abstract

Extracted data

Related items

Related items