Solutions of hard knapsack problems using extreme pruning

DOI10.1007/978-3-319-74325-7_4MaRDI QIDQ1624979zbMATH OpenOpenAlexFDO

Authors E. Daravigkas, Konstantinos A. Draziotis, Anastasia Papadopoulou

Publication date 28 November 2018

Full work available at URL https://doi.org/10.1007/978-3-319-74325-7_4

zbMATH Keywords

latticeknapsack problemsubset sum problemLLL reductionBKZ reductionextreme pruning

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Recommendations

• Exact methods for the knapsack problem and its generalizations
• Algorithms for some hard knapsack problems
• Hardness of approximation for knapsack problems
• scientific article; zbMATH DE number 4031399
• Publication:3471851
• Knapsack problems: a parameterized point of view
• scientific article; zbMATH DE number 4202023
• Exact approaches for the knapsack problem with setups
• Exact solution of a class of nonlinear knapsack problems
• A branch-and-bound algorithm for hard multiple knapsack problems

Cited in

(2)

• New generic algorithms for hard knapsacks
• Improved attacks on knapsack problem with their variants and a knapsack type ID-scheme

This page was built for publication: Solutions of hard knapsack problems using extreme pruning

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