Sensitivity Analysis to Perturbations of the Weight of a Subset of Items: The Single Knapsack Case Study

DOI10.1016/j.endm.2010.05.056zbMath1237.90195OpenAlexW2115229803MaRDI QIDQ2883592

Hedi Mhalla, Mhand Hifi

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

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

Related Items (1)

Tolerance analysis for 0-1 knapsack problems

Uses Software

• Knapsack

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The knapsack sharing problem: an exact algorithm
• 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: A negative result
• New trends in exact algorithms for the \(0-1\) knapsack problem
• An exact algorithm for the knapsack sharing problem
• 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
• A Max-Min Allocation Problem: Its Solutions and Applications
• An Algorithm for Large Zero-One Knapsack Problems
• Computing Partitions with Applications to the Knapsack Problem
• The Knapsack Sharing Problem

This page was built for publication: Sensitivity Analysis to Perturbations of the Weight of a Subset of Items: The Single Knapsack Case Study