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

DOI10.1016/J.ENDM.2010.05.056zbMATH Open1237.90195OpenAlexW2115229803MaRDI QIDQ2883592FDOQ2883592

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

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

zbMATH Keywords

sensitivity analysiscombinatorial optimizationoptimalityknapsack problem

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• An Algorithm for Large Zero-One Knapsack Problems
• Computing Partitions with Applications to the Knapsack Problem
• New trends in exact algorithms for the \(0-1\) knapsack problem
• An exact algorithm for the knapsack sharing problem
• Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
• Core problems in knapsack algorithms
• A New Algorithm for the 0-1 Knapsack Problem
• The Knapsack Sharing Problem
• The knapsack sharing problem: an exact algorithm
• Title not available (Why is that?)
• A Max-Min Allocation Problem: Its Solutions and Applications
• Sensitivity analysis for knapsack problems: A negative result
• 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
• Title not available (Why is that?)
• Sensitivity of the optimum to perturbations of the profit or weight of an item in the binary Knapsack problem

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 sharing problem: perturbation of the profit of an item
• Sensitivity analysis of the knapsack problem: a negative result
• Sensitivity analysis of the setup knapsack problem to perturbation of arbitrary profits or weights
• Sensitivity analysis for knapsack problems: A negative result

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)