A new class of hard problem instances for the 0–1 knapsack problem
Jorik Jooken, Pieter Leyman, Patrick De Causmaecker
Topics & Concepts
Knapsack problemClass (philosophy)Continuous knapsack problemComputer scienceMathematical optimizationCutting stock problemOptimization problemDecision problemCombinatorial optimizationChange-making problemComputational problemVariety (cybernetics)Polynomial-time approximation schemeMathematicsAlgorithmArtificial intelligenceOptimization and Packing ProblemsAdvanced Manufacturing and Logistics OptimizationMetaheuristic Optimization Algorithms Research