Sensitivity analysis of the Knapsack sharing problem: perturbation of the weight of an item
From MaRDI portal
Publication:2384607
DOI10.1016/j.cor.2006.02.025zbMath1149.90389OpenAlexW2154996796MaRDI QIDQ2384607
Publication date: 10 October 2007
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2006.02.025
Related Items (4)
Knapsack problems -- an overview of recent advances. I: Single knapsack problems ⋮ Sensitivity analysis of the knapsack sharing problem: perturbation of the profit of an item ⋮ Balancing of simple assembly lines under variations of task processing times ⋮ Reoptimization in Lagrangian methods for the \(0\)-\(1\) quadratic knapsack problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The knapsack sharing problem: an exact algorithm
- Solving knapsack sharing problems with general tradeoff functions
- Sensitivity of the optimum to perturbations of the profit or weight of an item in the binary Knapsack problem
- Minimax resource allocation problems: Optimization and parametric analysis
- A min-max resource allocation problem with substitutions
- Sensitivity analysis for knapsack problems: Another negative result
- Heuristic and reduction algorithms for the knapsack sharing problem
- Sensitivity analysis for knapsack problems: A negative result
- A linear-time algorithm for solving continuous maximin knapsack problems
- An exact algorithm for the knapsack sharing problem
- Sensitivity analysis of a greedy heuristic for knapsack problems
- A Max-Min Allocation Problem: Its Solutions and Applications
- Discrete-Variable Extremum Problems
This page was built for publication: Sensitivity analysis of the Knapsack sharing problem: perturbation of the weight of an item
