Abstract:
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.
Keywords:average number of iterations, knapsack problem, set packing problem, Gomory cut, branch and bound algorithm, $L$-class enumeration.
Fulltext:
PDF file (290 kB)