A hard knapsack problem

DOI10.1002/1520-6750(198802)35:1%3C85::AID-NAV3220350108%3E3.0.CO;2-DMaRDI QIDQ3780004zbMATH OpenOpenAlexFDO

Authors Chia-Shin Chung, Ming S. Hung, Walter O. Rom

Publication date 1988

Full work available at URL https://doi.org/10.1002/1520-6750(198802)35:1%3C85::aid-nav3220350108%3E3.0.co;2-d

zbMATH Keywords

general knapsack problems

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10)

Recommendations

• Where are the hard knapsack problems?
• scientific article; zbMATH DE number 1783857
• Yet harder knapsack problems
• scientific article; zbMATH DE number 1302173
• Upper Bounds and Algorithms for Hard 0-1 Knapsack Problems

Cited in

(13)

• scientific article; zbMATH DE number 1783857 (Why is no real title available?)
• A new class of hard problem instances for the 0-1 knapsack problem
• Technical Note—Some Very Easy Knapsack/Partition Problems
• Solving the knapsack problem via \(\mathbb Z\)-transform
• A hybrid algorithm for the unbounded knapsack problem
• Using modifications to Grover's search algorithm for quantum global optimization
• Where are the hard knapsack problems?
• scientific article; zbMATH DE number 2086933 (Why is no real title available?)
• Revisiting \textit{Where are the hard knapsack problems?} via instance space analysis
• Measuring instance difficulty for combinatorial optimization problems
• Asignacion de recuerdos max-min: Propiedades y algoritmos
• Yet harder knapsack problems
• Some Complexity Issues In A Class Of Knapsack Problems: What Makes A Knapsack Problem “Hard”?

This page was built for publication: A hard knapsack problem

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