Sensitivity analysis of the optimum to perturbation of the profit of a subset of items in the binary knapsack problem

DOI10.1016/j.disopt.2008.05.001zbMath1179.90271OpenAlexW2050251301MaRDI QIDQ955337

Mhand Hifi, Tarik Belgacem

Publication date: 19 November 2008

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disopt.2008.05.001

zbMATH Keywords

sensitivity analysiscombinatorial optimizationoptimalityknapsack

Mathematics Subject Classification ID

Sensitivity, stability, parametric optimization (90C31) Combinatorial optimization (90C27)

Related Items (4)

Knapsack problems -- an overview of recent advances. I: Single knapsack problems ⋮ Multicriteria investment problem with Savage's risk criteria: theoretical aspects of stability and case study ⋮ Tolerance analysis for 0-1 knapsack problems ⋮ Reoptimization in Lagrangian methods for the \(0\)-\(1\) quadratic knapsack problem

Uses Software

• Knapsack

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sensitivity of the optimum to perturbations of the profit or weight of an item in the binary Knapsack problem
• An algorithm for the solution of the 0-1 knapsack problem
• An upper bound for the zero-one knapsack problem and a branch and bound algorithm
• Sensitivity analysis for knapsack problems: Another negative result
• Sensitivity analysis for knapsack problems: A negative result
• New trends in exact algorithms for the \(0-1\) knapsack problem
• Sensitivity analysis of a greedy heuristic for knapsack problems
• Core Problems in Knapsack Algorithms
• Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
• A New Algorithm for the 0-1 Knapsack Problem
• An Algorithm for Large Zero-One Knapsack Problems
• Computing Partitions with Applications to the Knapsack Problem
• Discrete-Variable Extremum Problems

This page was built for publication: Sensitivity analysis of the optimum to perturbation of the profit of a subset of items in the binary knapsack problem