Analysis of the knapsack problem using L-partition

DOI10.1007/BF01068372zbMath0749.90053OpenAlexW2054405172MaRDI QIDQ4007376

Alexander 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\)-partitionperiodicity region\(L\)-covers

Mathematics Subject Classification ID

Integer programming (90C10)

Related Items (1)

Estimation of the number of iterations in integer programming algorithms using the regular partitions method

Cites Work

• An algorithm for the periodic solutions in the knapsack problem
• The Theory and Computation of Knapsack Functions
• Unnamed Item
• Unnamed Item

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