Conditions of solvability of vector problems using linear convolution of criteria
From MaRDI portal
DOI10.1007/BF02667917zbMATH Open0988.90028OpenAlexW2071491297MaRDI QIDQ1968512FDOQ1968512
Authors: É. Girlikh, M. M. Kovalyov, M. K. Kravtsov, O. A. Yanushkevich 
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
Recommendations
- Solvability of the vector problem by the linear criteria convolution algorithm
- Solvability of a class of discrete vector problems by the algorithms of linear convolution of criteria
- Problems of discrete vector optimization on systems of subsets which cannot be solved using a linear convolution algorithm
- Unsolvability of vector discrete optimization problems in the class of algorithms of linear convolution of criteria
- scientific article; zbMATH DE number 2107064
Cites Work
- Proper efficiency and the theory of vector maximization
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Complexity of discrete multicriteria problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Investigation of a linear convolution of criteria in multicriterial discrete programming
- Title not available (Why is that?)
- Problems of discrete vector optimization on systems of subsets which cannot be solved using a linear convolution algorithm
- Title not available (Why is that?)
- Conditions for Pareto optimality in a discrete vector problem on a system of subsets
Cited In (4)
This page was built for publication: Conditions of solvability of vector problems using linear convolution of criteria
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1968512)
