Budgeting with bounded multiple-choice constraints. (Q5928374)
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 1582540
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Budgeting with bounded multiple-choice constraints. |
scientific article; zbMATH DE number 1582540 |
Statements
Budgeting with bounded multiple-choice constraints. (English)
0 references
28 March 2001
0 references
Integer programming
0 references
Dantzig-Wolfe decomposition
0 references
Dynamic programming
0 references
Bounded multiple-choice knapsack problem
0 references
0.7747948169708252
0 references
0.7407209873199463
0 references
0.7402447462081909
0 references
0.7397518157958984
0 references
0.7390071153640747
0 references
