Sensitivity analysis of the knapsack sharing problem: perturbation of the profit of an item

DOI10.1111/j.1475-3995.2007.00619.xzbMath1135.90407OpenAlexW2123536478MaRDI QIDQ3502135

Mhand Hifi, Tarik Belgacem

Publication date: 22 May 2008

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/j.1475-3995.2007.00619.x

Mathematics Subject Classification ID

Minimax problems in mathematical programming (90C47) Sensitivity, stability, parametric optimization (90C31) Combinatorial optimization (90C27)

Cites Work

• 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
• An efficient algorithm for the knapsack sharing problem
• A linear-time algorithm for solving continuous maximin knapsack problems
• Sensitivity analysis of the Knapsack sharing problem: perturbation of the weight of an item
• An exact algorithm for the knapsack sharing problem
• A Max-Min Allocation Problem: Its Solutions and Applications
• The Knapsack Sharing Problem

This page was built for publication: Sensitivity analysis of the knapsack sharing problem: perturbation of the profit of an item