Strengthening a linear reformulation of the 0-1 cubic knapsack problem via variable reordering (Q2168744)
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 7576491
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Strengthening a linear reformulation of the 0-1 cubic knapsack problem via variable reordering |
scientific article; zbMATH DE number 7576491 |
Statements
Strengthening a linear reformulation of the 0-1 cubic knapsack problem via variable reordering (English)
0 references
26 August 2022
0 references
cubic binary optimization
0 references
knapsack
0 references
linearization
0 references
nonlinear optimization
0 references
heuristic
0 references
0 references
0 references
0 references
0 references
0.8429266810417175
0 references
0.7977384328842163
0 references
0.7588791847229004
0 references
0.7568792104721069
0 references
