Approximate and exact algorithms for the fixed-charge knapsack problem (Q2572244): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.ejor.2004.06.023 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2026884285 / rank | |||
Normal rank | |||
Revision as of 20:55, 19 March 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
