Structured \((\min ,+)\)-convolution and its applications for the shortest/closest vector and nonlinear knapsack problems (Q6181364)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7792585
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Structured \((\min ,+)\)-convolution and its applications for the shortest/closest vector and nonlinear knapsack problems |
scientific article; zbMATH DE number 7792585 |
Statements
Structured \((\min ,+)\)-convolution and its applications for the shortest/closest vector and nonlinear knapsack problems (English)
0 references
22 January 2024
0 references
convolution
0 references
nonlinear knapsack
0 references
separable objective
0 references
shortest vector problem
0 references
closest vector problem
0 references
dynamic programming
0 references
integer programming
0 references
piece-wise linear
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8307710289955139
0 references
0.809446394443512
0 references
0.7768166661262512
0 references
0.742530345916748
0 references
0.7310861349105835
0 references
