Testing integer knapsacks for feasibility

DOI10.1016/0377-2217(94)00214-2zbMATH Open0908.90192OpenAlexW2076444930MaRDI QIDQ1266633FDOQ1266633

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

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

zbMATH Keywords

dynamic programmingknapsack problemsfeasibility testingworst case time complexitygroup problem

Mathematics Subject Classification ID

Integer programming (90C10)

Cites Work

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

Cited In (8)

• Test sets of the knapsack problem and simultaneous Diophantine approximation
• New results for aggregating integer-valued equations
• Tolerance analysis for 0-1 knapsack problems
• Knapsack feasibility as an absolute value equation solvable by successive linear programming
• On variations of the subset sum problem
• Title not available (Why is that?)
• LLL-reduction for integer knapsacks
• Expected Frobenius numbers

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)