Sensitivity analysis of the knapsack problem: a negative result
type: Item
instance of: scholarly article
title: Sensitivity analysis of the knapsack problem: a negative result
zbMATH Open document ID: 1306.90133
author: N. V. Lishchuk
author: Victor A. Mikhailyuk
published in: Cybernetics and Systems Analysis
publication date: 2014-10-24T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C31
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 6361195
zbMATH Keywords: complexity of sensitivity analysis
zbMATH Keywords: NP- (DP-)hard problem
MaRDI profile type: Publication
full work available at URL: s10559-013-9500-9
OpenAlex ID: W1976909382
cites work: On the complexity of postoptimality analysis of \(0/1\) programs
cites work: Sensitivity analysis for knapsack problems: A negative result
cites work: General approach to estimating the complexity of postoptimality analysis for discrete optimization problems
cites work: Reoptimization of max \(k\)-cover: approximation ratio threshold
cites work: Sensitivity analysis for knapsack problems: Another negative result
cites work: Q4298260
DOI: 10.1007/S10559-013-9500-9
description: scientific article; zbMATH DE number 6361195