Sensitivity analysis to perturbations of the weight of a subset of items: the knapsack case study
type: Item
instance of: scholarly article
title: Sensitivity analysis to perturbations of the weight of a subset of items: the knapsack case study
zbMATH Open document ID: 1506.90224
author: Mhand Hifi
author: Hedi Mhalla
published in: Discrete Optimization
publication date: 2018-10-18T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C31
Mathematics Subject Classification ID: 90C39
zbMATH DE Number: 6958405
zbMATH Keywords: approximate limits
zbMATH Keywords: discrete optimization
zbMATH Keywords: knapsack problem
zbMATH Keywords: optimality
zbMATH Keywords: perturbation
zbMATH Keywords: sensitivity analysis
describes a project that uses: Knapsack
MaRDI profile type: Publication
full work available at URL: j.disopt.2013.08.003
OpenAlex ID: W2179575170
cites work: Sensitivity of the optimum to perturbations of the profit or weight of an item in the binary Knapsack problem
cites work: Q4821303
cites work: Computing Partitions with Applications to the Knapsack Problem
cites work: An upper bound for the zero-one knapsack problem and a branch and bound algorithm
cites work: An Algorithm for Large Zero-One Knapsack Problems
cites work: An algorithm for the solution of the 0-1 knapsack problem
cites work: New trends in exact algorithms for the \(0-1\) knapsack problem
cites work: Core problems in knapsack algorithms
cites work: Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
cites work: Approximation algorithms for knapsack problems with cardinality constraints
cites work: Exact solution of the robust knapsack problem
cites work: The inverse \(\{0,1\}\)-knapsack problem: theory, algorithms and computational experiments
cites work: The knapsack problem with a minimum filling constraint
cites work: The Knapsack Sharing Problem
cites work: A Max-Min Allocation Problem: Its Solutions and Applications
cites work: The knapsack sharing problem: an exact algorithm
cites work: Q3901292
cites work: Sensitivity analysis for knapsack problems: A negative result
cites work: An exact algorithm for the knapsack sharing problem
cites work: Q4377042
DOI: 10.1016/J.DISOPT.2013.08.003
description: scientific article; zbMATH DE number 6958405