Conditions of solvability of vector problems using linear convolution of criteria
From MaRDI portal
Publication:1968512
DOI10.1007/BF02667917zbMath0988.90028MaRDI QIDQ1968512
M. K. Kravtsov, M. M. Kovalyov, O. A. Yanushkevich, É. Girlikh
Publication date: 6 June 2000
Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02667917
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Investigation of a linear convolution of criteria in multicriterial discrete programming
- Conditions for Pareto optimality in a discrete vector problem on a system of subsets
- Problems of discrete vector optimization on systems of subsets which cannot be solved using a linear convolution algorithm
- Proper efficiency and the theory of vector maximization
- Complexity of discrete multicriteria problems