Sensitivity analysis to perturbations of the weight of a subset of items: the single knapsack case study

DOI10.1016/J.ENDM.2010.05.056MaRDI QIDQ2883592zbMATH OpenOpenAlexFDO

Authors Mhand Hifi, Hedi Mhalla

Publication date 13 May 2012

Published in Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.endm.2010.05.056

zbMATH Keywords

sensitivity analysiscombinatorial optimizationoptimalityknapsack problem

Mathematics Subject Classification ID

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

Recommendations

• Sensitivity analysis to perturbations of the weight of a subset of items: the knapsack case study
• 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
• Sensitivity analysis of the knapsack sharing problem: perturbation of the profit of an item
• Sensitivity analysis of the setup knapsack problem to perturbation of arbitrary profits or weights

Cites work

• scientific article; zbMATH DE number 3709922 (Why is no real title available?)
• scientific article; zbMATH DE number 1114459 (Why is no real title available?)
• scientific article; zbMATH DE number 2107164 (Why is no real title available?)
• A Max-Min Allocation Problem: Its Solutions and Applications
• A New Algorithm for the 0-1 Knapsack Problem
• An Algorithm for Large Zero-One Knapsack Problems
• An algorithm for the solution of the 0-1 knapsack problem
• An exact algorithm for the knapsack sharing problem
• An upper bound for the zero-one knapsack problem and a branch and bound algorithm
• Computing Partitions with Applications to the Knapsack Problem
• Core problems in knapsack algorithms
• Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
• New trends in exact algorithms for the \(0-1\) knapsack problem
• Sensitivity analysis for knapsack problems: A negative result
• Sensitivity of the optimum to perturbations of the profit or weight of an item in the binary Knapsack problem
• The Knapsack Sharing Problem
• The knapsack sharing problem: an exact algorithm

Cited in

(10)

• Sensitivity analysis of the optimum to perturbation of the profit of a subset of items in the binary knapsack problem
• Sensitivity of the optimum to perturbations of the profit or weight of an item in the binary Knapsack problem
• Sensitivity analysis to perturbations of the weight of a subset of items: the knapsack case study
• Tolerance analysis for 0-1 knapsack problems
• Sensitivity analysis of the Knapsack sharing problem: perturbation of the weight of an item
• Sensitivity analysis of a greedy heuristic for knapsack problems
• Sensitivity analysis of the knapsack problem: a negative result
• Sensitivity analysis of the knapsack sharing problem: perturbation of the profit of an item
• Sensitivity analysis for knapsack problems: A negative result
• Sensitivity analysis of the setup knapsack problem to perturbation of arbitrary profits or weights

Describes a project that uses

Uses Software

• Knapsack

This page was built for publication: Sensitivity analysis to perturbations of the weight of a subset of items: the single knapsack case study

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2883592)