Solutions of Hard Knapsack Problems Using Extreme Pruning

E. Daravigkas, K. A. Draziotis () and A. Papadopoulou
Additional contact information
E. Daravigkas: Aristotle University of Thessaloniki
K. A. Draziotis: Aristotle University of Thessaloniki
A. Papadopoulou: Aristotle University of Thessaloniki

A chapter in Modern Discrete Mathematics and Analysis, 2018, pp 81-95 from Springer

Abstract: Abstract In the present study we provide a review for the state-of-the-art attacks to the knapsack problem. We implemented the Schnorr-Shevchenko lattice attack, and we applied the new reduction strategy, BKZ 2.0. Finally, we compared the two implementations.

Keywords: Knapsack problem; Subset sum problem; Lattice; LLL reduction; BKZ reduction; Extreme pruning (search for similar items in EconPapers)
Date: 2018
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:spochp:978-3-319-74325-7_4

Ordering information: This item can be ordered from
http://www.springer.com/9783319743257

DOI: 10.1007/978-3-319-74325-7_4

Access Statistics for this chapter

More chapters in Springer Optimization and Its Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().