On the complexity of calculating sensitivity parameters in Boolean programming problems

DOI10.1007/S10559-015-9763-4MaRDI QIDQ904419zbMATH OpenOpenAlexFDO

Authors N. V. Lishchuk, Victor A. Mikhailyuk

Publication date 13 January 2016

Published in Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10559-015-9763-4

zbMATH Keywords

complexity of sensitivity analysisstability ball of radius \(r\) for an \(\epsilon\)-approximate problem solutionstability radius of a problem

Mathematics Subject Classification ID

Sensitivity, stability, parametric optimization (90C31) Boolean programming (90C09)

Recommendations

• The stability of the approximate Boolean minimization of a linear form
• Calculation of stability radii for combinatorial optimization problems
• scientific article; zbMATH DE number 781252
• Publication:3479821
• Some Complexity Issues In A Class Of Knapsack Problems: What Makes A Knapsack Problem “Hard”?

Cites work

• scientific article; zbMATH DE number 4093169 (Why is no real title available?)
• scientific article; zbMATH DE number 3791948 (Why is no real title available?)
• A Greedy Heuristic for the Set-Covering Problem
• Calculation of stability radii for combinatorial optimization problems
• General approach to estimating the complexity of postoptimality analysis for discrete optimization problems
• On the complexity of postoptimality analysis of 0/1 programs
• Reoptimization of max \(k\)-cover: approximation ratio threshold
• Sensitivity analysis for knapsack problems: A negative result
• Sensitivity analysis for knapsack problems: Another negative result
• Sensitivity analysis of the knapsack problem: a negative result
• Stability of solutions in problems of Boolean linear programming
• The stability of the approximate Boolean minimization of a linear form

Cited in

(3)

• Sensitivity analysis of efficient solution in vector MINMAX Boolean programming problem
• scientific article; zbMATH DE number 6419199 (Why is no real title available?)
• Remarks on ‘equivalence of stability concepts for discrete time-varying systems’

This page was built for publication: On the complexity of calculating sensitivity parameters in Boolean programming problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q904419)