Greedy algorithms for a class of knapsack problems with binary weights (Q1761999): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: MEMOTS / rank | |||
Normal rank | |||
Revision as of 20:16, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Greedy algorithms for a class of knapsack problems with binary weights |
scientific article |
Statements
Greedy algorithms for a class of knapsack problems with binary weights (English)
0 references
15 November 2012
0 references
knapsack problem
0 references
binary optimization
0 references
multiple criteria unconstrained optimization
0 references
connectedness
0 references
