Testing integer knapsacks for feasibility

DOI10.1016/0377-2217(94)00214-2zbMath0908.90192OpenAlexW2076444930MaRDI QIDQ1266633

Paul Hansen, Jennifer K. Ryan

Publication date: 18 March 1999

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(94)00214-2

zbMATH Keywords

dynamic programmingknapsack problemsfeasibility testingworst case time complexitygroup problem

Mathematics Subject Classification ID

Integer programming (90C10)

Related Items (4)

On variations of the subset sum problem ⋮ LLL-reduction for integer knapsacks ⋮ Expected Frobenius numbers ⋮ Tolerance analysis for 0-1 knapsack problems

Cites Work

• Unnamed Item
• The structure of an integral monoid and integer programming feasibility
• On the asymptotic integer algorithm
• Shortest-Route Methods: 2. Group Knapsacks, Expanded Networks, and Branch-and-Bound
• A New Knapsack Solution Approach by Integer Equivalent Aggregation and Consistency Determination
• Dynamic Programming Algorithms for the Integer Programming Problem—I: The Integer Programming Problem Viewed as a Knapsack Type Problem
• Integer Programming over a Finite Additive Group
• On a Problem of Partitions

This page was built for publication: Testing integer knapsacks for feasibility