Budgeting with bounded multiple-choice constraints. (Q5928374): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: An Algorithm for Large Zero-One Knapsack Problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Decomposition Principle for Linear Programs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An O(n) algorithm for the multiple-choice knapsack linear program / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3993418 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A minimal algorithm for the multiple-choice knapsack problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Multiple-Choice Knapsack Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An O(n) algorithm for the linear multiple choice knapsack problem and related problems / rank | |||
Normal rank | |||
Revision as of 14:52, 3 June 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
