On the exact separation of cover inequalities of maximum-depth (Q2115307)
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: On the exact separation of cover inequalities of maximum-depth |
scientific article; zbMATH DE number 7490488
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the exact separation of cover inequalities of maximum-depth |
scientific article; zbMATH DE number 7490488 |
Statements
On the exact separation of cover inequalities of maximum-depth (English)
0 references
15 March 2022
0 references
knapsack problem
0 references
cover inequalities
0 references
dynamic programming
0 references
mixed integer nonlinear programming
0 references
cutting plane generation
0 references
0 references
0 references
0 references
0 references
0.8302170634269714
0 references
0.8231375813484192
0 references
0.8122831583023071
0 references
0.7944101691246033
0 references
0.7889171242713928
0 references
