Estimating the computational complexity of one variant of parallel realization of the branch-and-bound method for the knapsack problem-Reference-Cited by-同舟云学术

Estimating the computational complexity of one variant of parallel realization of the branch-and-bound method for the knapsack problem

Published:2011-10 Issue:5 Volume:50 Page:756-765
ISSN:1064-2307
Container-title:Journal of Computer and Systems Sciences International
language:en
Short-container-title:J. Comput. Syst. Sci. Int.

Author:

Kolpakov R. M.,Posypkin M. A.

Publisher

Pleiades Publishing Ltd

Subject

Applied Mathematics,Computer Networks and Communications,Computer Vision and Pattern Recognition,Information Systems,Theoretical Computer Science,Control and Systems Engineering,Software

Link

http://link.springer.com/content/pdf/10.1134/S106423071105011X.pdf

Reference18 articles.

1. I. Kh. Sigal and A. P. Ivanova, Introduction to Applied Discrete Programming (FIZMATLIT, Moscow, 2007) [in Russian].

2. A. A. Korbut and Yu. Yu. Finkel’shtein, Discrete Programming (Nauka, Moscow, 1969) [in Russian].

3. N. N. Galim’yanova, A. A. Korbut, and I. Kh. Sigal, “Ratios of Optimal Values of Objective Functions of the Knapsack Problem and Its Linear Relaxation,” Izv. Ross. Akad. Nauk, Teor. Sist. Upr., No. 6, 53–61 (2009) [Comp. Syst. Sci. 48 (6), 906–913 (2009)].

4. A. A. Korbut and I. Kh. Sigal, “Exact and Greedy Solutions of the Knapsack Problem: the Ratio of Values of Objective Functions,” Izv. Ross. Akad. Nauk, Teor. Sist. Upr., No. 5, 79–86 (2010) [Comp. Syst. Sci. 49 (3), 757–764 (2010)].

5. A. A. Mironov, T. A. Levkina, and V. I. Tsurkov, “Minimax Estimates of Expectations of Arc Weights in Integer Networks with Fixed Node Degrees,” Applied and Computational Mathematics 8(2), 216–226 (2009).

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Optimality and Complexity Analysis of a Branch-and-Bound Method in Solving Some Instances of the Subset Sum Problem;Open Computer Science;2020-12-17

2. Organization of Product Specimen Data Storage in the Integrated Environment;Automation and Remote Control;2020-03

3. The scalability analysis of a parallel tree search algorithm;Optimization Letters;2020-02-12

4. A Criterion of Optimality of Some Parallelization Scheme for Backtrack Search Problem in Binary Trees;Communications in Computer and Information Science;2020

5. The Scalability Analysis of a Parallel Tree Search Algorithm;Communications in Computer and Information Science;2019