|
Zhurnal Vychislitel'noi Matematiki i Matematicheskoi Fiziki, 2005, Volume 45, Number 10, Pages 1801–1809
(Mi zvmmf580)
|
|
|
|
This article is cited in 8 scientific papers (total in 8 papers)
Investigation of algorithms for parallel computations in knapsack-type discrete optimization problems
M. A. Posypkina, I. Kh. Sigalb a Institute for System Programming, Russian Academy of Sciences
b Computing Center, Russian Academy of Sciences, ul. Vavilova 40, Moscow, 119991, Russia
Abstract:
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.
Received: 14.04.2005
Citation:
M. A. Posypkin, I. Kh. Sigal, “Investigation of algorithms for parallel computations in knapsack-type discrete optimization problems”, Zh. Vychisl. Mat. Mat. Fiz., 45:10 (2005), 1801–1809; Comput. Math. Math. Phys., 45:10 (2005), 1735–1742
Linking options:
https://www.mathnet.ru/eng/zvmmf580 https://www.mathnet.ru/eng/zvmmf/v45/i10/p1801
|
Statistics & downloads: |
Abstract page: | 697 | Full-text PDF : | 365 | References: | 48 | First page: | 1 |
|