scientific article; zbMATH DE number 4093181

MaRDI QIDQ3820375zbMATH OpenFDO

Authors M. D. Bachurina, S. V. Beletskij, V. Ts. Levental

Publication date 1986

zbMATH Keywords

exact solutionspseudo-polynomial algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10)

Recommendations

• scientific article; zbMATH DE number 4031399
• An algorithm for solving a class of knapsack problems and its generalization
• scientific article; zbMATH DE number 3852791
• A new enumeration scheme for the knapsack problem
• scientific article; zbMATH DE number 536590

Cited in

(12)

• A new enumeration scheme for the knapsack problem
• Pseudopolynomial algorithms for the solution of backpack problems
• Dynamic programming revisited: Improving knapsack algorithms
• A pseudo-polynomial time algorithm for solving the knapsack problem in polynomial space
• scientific article; zbMATH DE number 7401920 (Why is no real title available?)
• scientific article; zbMATH DE number 3989108 (Why is no real title available?)
• scientific article; zbMATH DE number 4031399 (Why is no real title available?)
• scientific article; zbMATH DE number 4068626 (Why is no real title available?)
• scientific article; zbMATH DE number 2059840 (Why is no real title available?)
• Extension of Brickell’S Algorithm for Breaking High Density Knapsacks
• An algorithm for solving a class of knapsack problems and its generalization
• Pseudo-polynomial algorithms for solving the knapsack problem with dependencies between items

This page was built for publication:

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