Analysis of the knapsack problem using L-partition

DOI10.1007/BF01068372MaRDI QIDQ4007376zbMATH OpenOpenAlexFDO

Authors A. A. Kolokolov, E. V. Tsepkova

Publication date 27 September 1992

Published in Cybernetics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01068372

zbMATH Keywords

\(L\)-covers\(L\)-partitionperiodicity region

Mathematics Subject Classification ID

Integer programming (90C10)

Recommendations

• A constructive periodicity bound for the unbounded knapsack problem
• scientific article; zbMATH DE number 4005976
• Tight bounds for periodicity theorems on the unbounded knapsack problem
• Least-cost partition algorithms
• A solution method for a knapsack problem and its variant

Cites work

• An algorithm for the periodic solutions in the knapsack problem
• scientific article; zbMATH DE number 3947998 (Why is no real title available?)
• scientific article; zbMATH DE number 3314878 (Why is no real title available?)
• The Theory and Computation of Knapsack Functions

Cited in

(2)

• Estimation of the number of iterations in integer programming algorithms using the regular partitions method
• An analysis of the LPT algorithm for the max-min and the min-ratio partition problems

This page was built for publication: Analysis of the knapsack problem using L-partition

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4007376)