Sensitivity analysis of the setup knapsack problem to perturbation of arbitrary profits or weights

DOI10.1111/itor.12373zbMath1391.90500OpenAlexW2593358764MaRDI QIDQ4642122

Hedi Mhalla, Ferhan Al-Maliky, Mhand Hifi

Publication date: 22 May 2018

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

Full work available at URL: https://doi.org/10.1111/itor.12373

zbMATH Keywords

optimizationsensitivity analysisoptimalityapproximationknapsack

Mathematics Subject Classification ID

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

Related Items (6)

Knapsack problems -- an overview of recent advances. I: Single knapsack problems ⋮ Combining local branching and descent method for solving the multiple‐choice knapsack problem with setups ⋮ Sensitivity analyses and measurements for group decisions using weighted scoring rules ⋮ Multicriteria investment problem with Savage's risk criteria: theoretical aspects of stability and case study ⋮ Sensitivity analysis of combinatorial optimization problems using evolutionary bilevel optimization and data mining ⋮ LP relaxation and dynamic programming enhancing VNS for the multiple knapsack problem with setup

This page was built for publication: Sensitivity analysis of the setup knapsack problem to perturbation of arbitrary profits or weights