Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Solutions of hard knapsack problems using extreme pruning

From MaRDI portal
Publication:1624979
Jump to:navigation, search

DOI10.1007/978-3-319-74325-7_4zbMath1410.90177OpenAlexW2856174035MaRDI QIDQ1624979

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)







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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1624979&oldid=13926446"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 03:26.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki