Sensitivity analysis for knapsack problems: A negative result
type: Item
instance of: scholarly article
title: Sensitivity analysis for knapsack problems: A negative result
zbMATH Open document ID: 0895.90155
DOI: 10.1016/S0166-218X(97)00080-2
author: D. Massart
published in: Discrete Applied Mathematics
publication date: 1998-03-25T00:00:00Z
full work available at URL: dam
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C31
Mathematics Subject Classification ID: 90C09
zbMATH DE Number: 1133156
zbMATH Keywords: sensitivity analysis
zbMATH Keywords: knapsack problems
MaRDI profile type: Publication
cites work: Aggregation of nonnegative integer-valued equations
cites work: Sequential and simultaneous aggregation of diophantine equations
cites work: Transformation of integer programs to knapsack problems
cites work: On the reduction method for integer linear programs. II
cites work: Q4198056
cites work: New results on equivalent integer programming formulations
cites work: New results for aggregating integer-valued equations
cites work: A new reduction method in integer programming
cites work: Equivalent knapsack‐type formulations of bounded integer linear programs: An alternative approach
OpenAlex ID: W2110628946
Recommended article: Sensitivity analysis of the knapsack problem: a negative result
Recommended article: Sensitivity analysis for knapsack problems: Another negative result
Recommended article: Sensitivity analysis of a greedy heuristic for knapsack problems
Recommended article: Sensitivity analysis of the setup knapsack problem to perturbation of arbitrary profits or weights
Recommended article: Sensitivity analysis to perturbations of the weight of a subset of items: the knapsack case study
Recommended article: Sensitivity analysis of the Knapsack sharing problem: perturbation of the weight of an item
Recommended article: Sensitivity analysis to perturbations of the weight of a subset of items: the single knapsack case study
Recommended article: Sensitivity analysis of the knapsack sharing problem: perturbation of the profit of an item
Recommended article: Sensitivity analysis of the optimum to perturbation of the profit of a subset of items in the binary knapsack problem
Recommended article: Sensitivity of the optimum to perturbations of the profit or weight of an item in the binary Knapsack problem
description: scientific article; zbMATH DE number 1133156