Pseudopolynomial algorithms for the solution of backpack problems

DOI10.1007/BF01105299zbMath0792.90048OpenAlexW2052852800MaRDI QIDQ1325402

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

Publication date: 5 July 1994

Published in: Journal of Soviet Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

exact solutionspseudo-polynomial algorithms

Mathematics Subject Classification ID

Integer programming (90C10)

Cites Work

• Hard Knapsack Problems
• On Knapsacks, Partitions, and a New Dynamic Programming Technique for Trees
• Efficient Algorithm for the Partitioning of Trees
• Unnamed Item
• Unnamed Item

This page was built for publication: Pseudopolynomial algorithms for the solution of backpack problems