A hard knapsack problem

DOI10.1002/1520-6750(198802)35:1%3C85::AID-NAV3220350108%3E3.0.CO;2-DzbMATH Open0638.90073OpenAlexW2040181993MaRDI QIDQ3780004FDOQ3780004

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

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

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

zbMATH Keywords

general knapsack problems

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (12)

• Title not available (Why is that?)
• 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?
• Title not available (Why is that?)
• 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)