Dynamic programming algorithm with objective level cut for nonlinear knapsack problem (Q2823517)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Dynamic programming algorithm with objective level cut for nonlinear knapsack problem |
scientific article; zbMATH DE number 6634329
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Dynamic programming algorithm with objective level cut for nonlinear knapsack problem |
scientific article; zbMATH DE number 6634329 |
Statements
6 October 2016
0 references
nonlinear integer programming
0 references
dynamic programming
0 references
surrogate constraint
0 references
objective level cut
0 references
0.91341925
0 references
0.90825415
0 references
0.8897343
0 references
0.88566697
0 references
0.88536555
0 references
0.88506365
0 references
Dynamic programming algorithm with objective level cut for nonlinear knapsack problem (English)
0 references
