Investigation of algorithms for parallel computations in knapsack-type discrete optimization problems
Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 45 (2005) no. 10, pp. 1801-1809
Voir la notice de l'article provenant de la source Math-Net.Ru
Efficient parallel implementation of the branch-and-bound method in discrete optimization problems is considered. A description of particular algorithms and of their implementation is given. Based on experimental data, conclusions concerning the efficiency of those algorithms are drawn and factors affecting their performance are investigated.
@article{ZVMMF_2005_45_10_a4,
author = {M. A. Posypkin and I. Kh. Sigal},
title = {Investigation of algorithms for parallel computations in knapsack-type discrete optimization problems},
journal = {\v{Z}urnal vy\v{c}islitelʹnoj matematiki i matemati\v{c}eskoj fiziki},
pages = {1801--1809},
publisher = {mathdoc},
volume = {45},
number = {10},
year = {2005},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/ZVMMF_2005_45_10_a4/}
}
TY - JOUR AU - M. A. Posypkin AU - I. Kh. Sigal TI - Investigation of algorithms for parallel computations in knapsack-type discrete optimization problems JO - Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki PY - 2005 SP - 1801 EP - 1809 VL - 45 IS - 10 PB - mathdoc UR - http://geodesic.mathdoc.fr/item/ZVMMF_2005_45_10_a4/ LA - ru ID - ZVMMF_2005_45_10_a4 ER -
%0 Journal Article %A M. A. Posypkin %A I. Kh. Sigal %T Investigation of algorithms for parallel computations in knapsack-type discrete optimization problems %J Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki %D 2005 %P 1801-1809 %V 45 %N 10 %I mathdoc %U http://geodesic.mathdoc.fr/item/ZVMMF_2005_45_10_a4/ %G ru %F ZVMMF_2005_45_10_a4
M. A. Posypkin; I. Kh. Sigal. Investigation of algorithms for parallel computations in knapsack-type discrete optimization problems. Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 45 (2005) no. 10, pp. 1801-1809. http://geodesic.mathdoc.fr/item/ZVMMF_2005_45_10_a4/