I. Kh. Sigal
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
I. Kh. Sigal has a total of 3 co-authors. Here are the top co-authors by number of shared publications:
A. A. Korbut
Russian Academy of Sciences
2 shared publications- Mikhail Posypkin
Federal Research Center “Computer Science and Control” of the Russian Academy of Sciences, Moscow, Russia
1 shared publication N. N. Galim’YAnova
Russian Academy of Sciences
1 shared publication
Latest Publications
- 21 October 2010
- Published by Pleiades Publishing Ltd in Journal of Computer and Systems Sciences International
- Vol. 49 (5) , 757-764
Exact and greedy solutions of the knapsack problem: the ratio of values of objective functions
Ratios δ of the values of objective functions of optimal Boolean (or integer) to the values of greedy solutions for the knapsack problem are considered. The relationship of the parameter δ with the ratio Δ of the values of objective functions for the optimal solution of linear relaxation to the values of optimal integer solution was found. Two-sided estimates for δ and Δ were obtained. A computational experiment was conducted to investigate the ratio of δ of problems of one- and two-dimensional knapsack problems with Boolean variables. A hypothesis on asymptotic behavior of the ratio δ with growth of the number of problem variables was formulated.
- 21 October 2010
- Published by Pleiades Publishing Ltd in Journal of Computer and Systems Sciences International
- Vol. 49 (5) , 757-764
Exact and greedy solutions of the knapsack problem: the ratio of values of objective functions
Ratios δ of the values of objective functions of optimal Boolean (or integer) to the values of greedy solutions for the knapsack problem are considered. The relationship of the parameter δ with the ratio Δ of the values of objective functions for the optimal solution of linear relaxation to the values of optimal integer solution was found. Two-sided estimates for δ and Δ were obtained. A computational experiment was conducted to investigate the ratio of δ of problems of one- and two-dimensional knapsack problems with Boolean variables. A hypothesis on asymptotic behavior of the ratio δ with growth of the number of problem variables was formulated.
- 21 December 2009
- Published by Pleiades Publishing Ltd in Journal of Computer and Systems Sciences International
- Vol. 48 (6) , 906-913
Ratios of optimal values of objective functions of the knapsack problem and its linear relaxation
The ratios of the values of objective functions for optimal solutions of linear and integer knapsack problems are considered. Estimates for these ratios are obtained. One-dimensional and multi-dimensional knapsack problems with Boolean variables are studied experimentally. For these problems, a hypothesis is formulated on the asymptotic behavior of the ratio as the number of variables grows.
- 21 December 2009
- Published by Pleiades Publishing Ltd in Journal of Computer and Systems Sciences International
- Vol. 48 (6) , 906-913
Ratios of optimal values of objective functions of the knapsack problem and its linear relaxation
The ratios of the values of objective functions for optimal solutions of linear and integer knapsack problems are considered. Estimates for these ratios are obtained. One-dimensional and multi-dimensional knapsack problems with Boolean variables are studied experimentally. For these problems, a hypothesis is formulated on the asymptotic behavior of the ratio as the number of variables grows.
- 1 September 2007
- Published by Pleiades Publishing Ltd in Computational Mathematics and Mathematical Physics
- Vol. 47 (9) , 1464-1476
Application of parallel heuristic algorithms for speeding up parallel implementations of the branch-and-bound method
A scheme for the parallel implementation of the combined branch-and-bound method and heuristic algorithms is proposed. Results of computations for the one-dimensional Boolean knapsack problem are...
- 1 September 2007
- Published by Pleiades Publishing Ltd in Computational Mathematics and Mathematical Physics
- Vol. 47 (9) , 1464-1476
Application of parallel heuristic algorithms for speeding up parallel implementations of the branch-and-bound method
A scheme for the parallel implementation of the combined branch-and-bound method and heuristic algorithms is proposed. Results of computations for the one-dimensional Boolean knapsack problem are...