Budgeting with bounded multiple-choice constraints. (Q5928374): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q58826472, #quickstatements; #temporary_batch_1706814575051 |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: CPLEX / rank | |||
Normal rank | |||
Revision as of 06:43, 28 February 2024
scientific article; zbMATH DE number 1582540
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
