Sensitivity analysis of a greedy heuristic for knapsack problems (Q2569123): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Calculation of stability radii for combinatorial optimization problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Advances in sensitivity analysis and parametric programming / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Sensitivity analysis of list scheduling heuristics / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3901292 / rank | |||
Normal rank | |||
Revision as of 16:36, 10 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Sensitivity analysis of a greedy heuristic for knapsack problems |
scientific article |
Statements
Sensitivity analysis of a greedy heuristic for knapsack problems (English)
0 references
17 October 2005
0 references
combinatorial optimization
0 references
heuristics
0 references
sensitivity analysis
0 references
knapsack problems
0 references
