The knapsack problem with disjoint multiple-choice constraints (Q3993988)
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: The knapsack problem with disjoint multiple-choice constraints |
scientific article; zbMATH DE number 40474
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The knapsack problem with disjoint multiple-choice constraints |
scientific article; zbMATH DE number 40474 |
Statements
The knapsack problem with disjoint multiple-choice constraints (English)
0 references
13 August 1992
0 references
multiple-choice knapsack problem
0 references
GUB constraints
0 references
two-stage algorithm
0 references
Lagrangean dual
0 references
branch-and-bound
0 references
0.8576226234436035
0 references
0.8520284295082092
0 references
0.8427426218986511
0 references
