20 search results - page 1 / 4 » Improved Generic Algorithms for Hard Knapsacks |
63
Voted
IACR
2011
13 years 9 months ago
2011
At Eurocrypt 2010, Howgrave-Graham and Joux described an algorithm for solving hard knapsacks of density close to 1 in time ˜O(20.337n ) and memory ˜O(20.256n ), thereby improvin...
EUROCRYPT
2010
Springer
15 years 2 months ago
2010
Springer
83
Voted
MP
2010
14 years 8 months ago
2010
Valid inequalities for 0-1 knapsack polytopes often prove useful when tackling hard 0-1 Linear Programming problems. To generate such inequalities, one needs separation algorithms...
JAIR
2007
14 years 9 months ago
2007
Many combinatorial optimization problems such as the bin packing and multiple knapsack problems involve assigning a set of discrete objects to multiple containers. These problems ...
EVOW
2008
Springer
14 years 11 months ago
2008
Springer
Recently, a new iterative optimization framework utilizing an evolutionary algorithm called "Prototype Optimization with Evolved iMprovement Steps" (POEMS) was introduced...