Sensitivity analysis of a greedy heuristic for knapsack problems

DOI10.1016/j.ejor.2004.09.025zbMath1101.90056OpenAlexW2103463374MaRDI QIDQ2569123

Gerard Sierksma, Diptesh Ghosh, Nilotpal Chakravarti

Publication date: 17 October 2005

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2004.09.025

zbMATH Keywords

heuristicssensitivity analysiscombinatorial optimizationknapsack problems

Mathematics Subject Classification ID

Sensitivity, stability, parametric optimization (90C31) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (4)

Knapsack problems -- an overview of recent advances. I: Single knapsack problems ⋮ Sensitivity analysis of the Knapsack sharing problem: perturbation of the weight of an item ⋮ Sensitivity analysis of the optimum to perturbation of the profit of a subset of items in the binary knapsack problem ⋮ Using modifications to Grover's search algorithm for quantum global optimization

Cites Work

• Unnamed Item
• Calculation of stability radii for combinatorial optimization problems
• Sensitivity analysis of list scheduling heuristics
• Advances in sensitivity analysis and parametric programming

This page was built for publication: Sensitivity analysis of a greedy heuristic for knapsack problems