Testing integer knapsacks for feasibility

DOI10.1016/0377-2217(94)00214-2MaRDI QIDQ1266633zbMATH OpenOpenAlexFDO

Authors 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 programmingfeasibility testinggroup problemknapsack problemsworst case time complexity

Mathematics Subject Classification ID

Integer programming (90C10)

Recommendations

• scientific article; zbMATH DE number 3876925
• A solution method for a knapsack problem and its variant
• scientific article; zbMATH DE number 2086933
• Hard Equality Constrained Integer Knapsacks
• scientific article; zbMATH DE number 4160465

Cites work

• 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
• scientific article; zbMATH DE number 3126094 (Why is no real title available?)
• Integer Programming over a Finite Additive Group
• On a Problem of Partitions
• On the asymptotic integer algorithm
• Shortest-Route Methods: 2. Group Knapsacks, Expanded Networks, and Branch-and-Bound
• The structure of an integral monoid and integer programming feasibility

Cited in

(9)

• Knapsack feasibility as an absolute value equation solvable by successive linear programming
• On variations of the subset sum problem
• Tolerance analysis for 0-1 knapsack problems
• New results for aggregating integer-valued equations
• LLL-reduction for integer knapsacks
• scientific article; zbMATH DE number 2086933 (Why is no real title available?)
• Expected Frobenius numbers
• A combinatorial certifying algorithm for linear programming problems with gainfree Leontief substitution systems
• Test sets of the knapsack problem and simultaneous Diophantine approximation

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

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