An approach to solving discrete vector optimization problems over a combinatorial set of permutations
From MaRDI portal
Publication:946788
DOI10.1007/s10559-008-9016-xzbMath1143.90388OpenAlexW2043026548MaRDI QIDQ946788
L. N. Kolechkina, A. N. Nagirna, N. V. Semenova
Publication date: 24 September 2008
Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)
Full work available at URL: http://dspace.puet.edu.ua/handle/123456789/3421
Related Items (9)
Influence of certain transpositions on the cyclic structure of permutations ⋮ Optimal search for locally feasible solutions of a linear function on permutations ⋮ A method to solve conditional optimization problems with quadratic objective functions on the set of permutations ⋮ Theory and methods of Euclidian combinatorial optimization: current status and prospects ⋮ Vector optimization problems with linear criteria over a fuzzy combinatorial set of alternatives ⋮ Modified coordinate method to solve multicriteria optimization problems on combinatorial configurations ⋮ Attainability of optimal solutions to a linear problem of multicriterion optimization with respect to the weighed sum of variously important and transitively subordinated criteria ⋮ Method of ordering the values of a linear function on a set of permutations ⋮ A polyhedral approach to solving multicriterion combinatorial optimization problems over sets of polyarrangements
Cites Work
- Stability of vector problems of integer optimization: relationship with the stability of sets of optimal and nonoptimal solutions
- Solution and investigation of one class of inexact integer programming problems
- Existence of solutions in vector optimization problems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: An approach to solving discrete vector optimization problems over a combinatorial set of permutations
