An algorithm for solving a class of discrete multicriterion problems
Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 23 (1983) no. 3, pp. 576-589
Cet article a éte moissonné depuis la source Math-Net.Ru
An algorithm is given for solving problems of multicriterion discrete optimization; it is based on the use of the minimum function when partial criteria are convoluted. In the case of monotonic constraints, the algorithm guarantees that a complete inspection isavoided.
@article{ZVMMF_1983_23_3_a6,
author = {M. G. Kreines and N. M. Novikova},
title = {An algorithm for solving a class of discrete multicriterion problems},
journal = {\v{Z}urnal vy\v{c}islitelʹnoj matematiki i matemati\v{c}eskoj fiziki},
pages = {576--589},
year = {1983},
volume = {23},
number = {3},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/ZVMMF_1983_23_3_a6/}
}
TY - JOUR AU - M. G. Kreines AU - N. M. Novikova TI - An algorithm for solving a class of discrete multicriterion problems JO - Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki PY - 1983 SP - 576 EP - 589 VL - 23 IS - 3 UR - http://geodesic.mathdoc.fr/item/ZVMMF_1983_23_3_a6/ LA - ru ID - ZVMMF_1983_23_3_a6 ER -
M. G. Kreines; N. M. Novikova. An algorithm for solving a class of discrete multicriterion problems. Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 23 (1983) no. 3, pp. 576-589. http://geodesic.mathdoc.fr/item/ZVMMF_1983_23_3_a6/