Voir la notice de l'article provenant de la source Math-Net.Ru
@article{DM_2019_31_4_a1, author = {R. M. Kolpakov and M. A. Posypkin}, title = {Effective parallelization strategy for the solution of subset sum problems by the branch-and-bound method}, journal = {Diskretnaya Matematika}, pages = {20--37}, publisher = {mathdoc}, volume = {31}, number = {4}, year = {2019}, language = {ru}, url = {http://geodesic.mathdoc.fr/item/DM_2019_31_4_a1/} }
TY - JOUR AU - R. M. Kolpakov AU - M. A. Posypkin TI - Effective parallelization strategy for the solution of subset sum problems by the branch-and-bound method JO - Diskretnaya Matematika PY - 2019 SP - 20 EP - 37 VL - 31 IS - 4 PB - mathdoc UR - http://geodesic.mathdoc.fr/item/DM_2019_31_4_a1/ LA - ru ID - DM_2019_31_4_a1 ER -
%0 Journal Article %A R. M. Kolpakov %A M. A. Posypkin %T Effective parallelization strategy for the solution of subset sum problems by the branch-and-bound method %J Diskretnaya Matematika %D 2019 %P 20-37 %V 31 %N 4 %I mathdoc %U http://geodesic.mathdoc.fr/item/DM_2019_31_4_a1/ %G ru %F DM_2019_31_4_a1
R. M. Kolpakov; M. A. Posypkin. Effective parallelization strategy for the solution of subset sum problems by the branch-and-bound method. Diskretnaya Matematika, Tome 31 (2019) no. 4, pp. 20-37. http://geodesic.mathdoc.fr/item/DM_2019_31_4_a1/