Average performance of greedy heuristics for the integer knapsack problem. (Q1420409): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0377-2217(02)00810-x / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2084002770 / rank | |||
Normal rank | |||
Latest revision as of 10:24, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Average performance of greedy heuristics for the integer knapsack problem. |
scientific article |
Statements
Average performance of greedy heuristics for the integer knapsack problem. (English)
0 references
2 February 2004
0 references
Heuristics
0 references
Combinatorial optimization
0 references
Integer programming
0 references
Knapsack
0 references
Probabilistic algorithm
0 references
0 references
0 references
