Optimization algorithms for the disjunctively constrained knapsack problem (Q1797814)
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 6960179
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimization algorithms for the disjunctively constrained knapsack problem |
scientific article; zbMATH DE number 6960179 |
Statements
Optimization algorithms for the disjunctively constrained knapsack problem (English)
0 references
22 October 2018
0 references
knapsack problem
0 references
disjunctive constraints
0 references
polytope
0 references
facet
0 references
separation
0 references
branch-and-cut
0 references
0 references
0 references
0 references
0 references
0.8457161784172058
0 references
0.8377557992935181
0 references
0.8336600065231323
0 references
0.8248745799064636
0 references
0.8034846186637878
0 references
