A polyhedral approach to solving multicriterion combinatorial optimization problems over sets of polyarrangements |
| |
| Authors: | N V Semenova L N Kolechkina |
| |
| Affiliation: | (1) V. M. Glushkov Institute of Cybernetics, National Academy of Sciences of Ukraine, Kyiv, Ukraine |
| |
| Abstract: | Multicriterion discrete optimization problems over feasible combinatorial sets of polyarrangements are considered. Structural
properties of feasible domains and different types of efficient solutions are investigated. Based on the ideas of Euclidean
combinatorial optimization and the major criterion method, a polyhedral approach to the solution of the problems is developed
and substantiated.
Translated from Kibernetika i Sistemnyi Analiz, No. 3, pp. 118-126, May-June 2009. |
| |
| Keywords: | multicriterion optimization discrete optimization combinatorial sets polyarrangements Pareto-optimal solutions weakly and strongly efficient solutions |
| 本文献已被 SpringerLink 等数据库收录！ |
