Sensitivity analysis to perturbations of the weight of a subset of items: the knapsack case study
From MaRDI portal
Publication:1799388
DOI10.1016/j.disopt.2013.08.003zbMath1506.90224OpenAlexW2179575170MaRDI QIDQ1799388
Publication date: 18 October 2018
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disopt.2013.08.003
Sensitivity, stability, parametric optimization (90C31) Combinatorial optimization (90C27) Dynamic programming (90C39)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Exact solution of the robust knapsack problem
- 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
- Approximation algorithms for knapsack problems with cardinality constraints
- The inverse \(\{0,1\}\)-knapsack problem: theory, algorithms and computational experiments
- An exact algorithm for the knapsack sharing problem
- Core Problems in Knapsack Algorithms
- Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
- The knapsack problem with a minimum filling constraint
- 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 knapsack case study
