A branch-and-bound algorithm for hard multiple knapsack problems (Q545544): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: Knapsack / rank | |||
Normal rank | |||
Revision as of 16:56, 28 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A branch-and-bound algorithm for hard multiple knapsack problems |
scientific article |
Statements
A branch-and-bound algorithm for hard multiple knapsack problems (English)
0 references
22 June 2011
0 references
