Approximate and exact algorithms for the fixed-charge knapsack problem (Q2572244): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 07:07, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximate and exact algorithms for the fixed-charge knapsack problem |
scientific article |
Statements
Approximate and exact algorithms for the fixed-charge knapsack problem (English)
0 references
16 November 2005
0 references
Branch-and-bound
0 references
Fixed-charge
0 references
Knapsack problems
0 references
