An iterative pseudo-gap enumeration approach for the multidimensional multiple-choice knapsack problem (Q1753394)
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: An iterative pseudo-gap enumeration approach for the multidimensional multiple-choice knapsack problem |
scientific article; zbMATH DE number 6875747
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An iterative pseudo-gap enumeration approach for the multidimensional multiple-choice knapsack problem |
scientific article; zbMATH DE number 6875747 |
Statements
An iterative pseudo-gap enumeration approach for the multidimensional multiple-choice knapsack problem (English)
0 references
29 May 2018
0 references
integer programming
0 references
heuristics
0 references
multidimensional multiple-choice knapsack
0 references
reduced cost constraint
0 references
0 references
0 references
0 references
0 references
0 references
0.91006106
0 references
0.8989122
0 references
0.89636934
0 references
0.89522725
0 references
0.89515305
0 references
0.8947232
0 references
0.8935215
0 references
0.8899099
0 references
