Solvability of a class of discrete vector problems by the algorithms of linear convolution of criteria (Q1569405)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1467927
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solvability of a class of discrete vector problems by the algorithms of linear convolution of criteria |
scientific article; zbMATH DE number 1467927 |
Statements
Solvability of a class of discrete vector problems by the algorithms of linear convolution of criteria (English)
0 references
4 July 2000
0 references
The possibility of application of the algorithm of linear convolution of criteria (ALCC) for the determination of the Pareto set in multicriteria trajectory minimization problems with one arbitrary and several ``bottleneck'' criteria is investigated. An algorithm is proposed that allows one to reduce any such problem to a problem with the same Pareto set, which can be solved by the ALCC. Examples are presented when the estimate of the complexity of the reduction is polynomial with respect to the dimension of the problem.
0 references
algorithm of linear convolution of criteria
0 references
Pareto set
0 references
multicriteria trajectory minimization
0 references
0.9138332605361938
0 references
0.8601818680763245
0 references
0.8276564478874207
0 references
