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