Some Easy Instances of Ideal-SVP and Implications on the Partial Vandermonde Knapsack Problem.
Katharina BoudgoustErell GachonAlice Pellet-MaryPublished in: IACR Cryptol. ePrint Arch. (2022)
Keyphrases
- knapsack problem
- linear programming relaxation
- randomly generated test instances
- combinatorial optimization problems
- optimal solution
- test problems
- optimization problems
- dynamic programming
- multidimensional knapsack problem
- np hard problems
- np hard
- continuous relaxation
- exact algorithms
- heuristic solution
- greedy algorithm
- greedy heuristic
- cutting plane
- bicriteria
- np complete
- decision variables
- randomly generated
- implicit enumeration
- evolutionary algorithm
- search space