This article is cited in 1 scientific paper (total in 1 paper)
Bounds on average number of iterations of the algorithms for solving some Boolean programming problems
L. A. Zaozerskaya, A. A. Kolokolov, N. G. Gofman
Omsk Department of S. L. Sobolev Institute of Mathematics, SB RAS, Omsk, Russia
The paper is devoted to the polynomial upper bounds on average number of iterations for some integer linear programming algorithms for solving the multidimensional knapsack problem and the set packing problem. These results were obtained using earlier suggested approach. Expansions of the known classes of problems with similar bounds are described. Tab. 2, bibliogr. 19.
average number of iterations, knapsack problem, set packing problem, Gomory cut, branch and bound algorithm, $L$-class enumeration.
PDF file (290 kB)
L. A. Zaozerskaya, A. A. Kolokolov, N. G. Gofman, “Bounds on average number of iterations of the algorithms for solving some Boolean programming problems”, Diskretn. Anal. Issled. Oper., 18:3 (2011), 49–64
Citation in format AMSBIB
\by L.~A.~Zaozerskaya, A.~A.~Kolokolov, N.~G.~Gofman
\paper Bounds on average number of iterations of the algorithms for solving some Boolean programming problems
\jour Diskretn. Anal. Issled. Oper.
Citing articles on Google Scholar:
Related articles on Google Scholar:
This publication is cited in the following articles:
A. A. Kolokolov, L. A. Zaozerskaya, “Finding and analysis of estimation of the number of iterations in integer programming algorithms using the regular partitioning method”, Russian Math. (Iz. VUZ), 58:1 (2014), 35–46
|Number of views:|