The 0-1 knapsack problem with multiple choice constraints (Q1248462): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q4178782 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Integer Programming Algorithms: A Framework and State-of-the-Art Survey / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Reduction Algorithm for Zero-One Single Knapsack Problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3901292 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An Efficient Algorithm for the 0-1 Knapsack Problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A branch and bound algorithm for the generalized assignment problem / rank | |||
Normal rank |
Revision as of 22:57, 12 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The 0-1 knapsack problem with multiple choice constraints |
scientific article |
Statements
The 0-1 knapsack problem with multiple choice constraints (English)
0 references
1978
0 references