On the complexity of calculating sensitivity parameters in Boolean programming problems

DOI10.1007/s10559-015-9763-4zbMath1330.90054OpenAlexW2183497763MaRDI QIDQ904419

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)

Cites Work

• Unnamed Item
• Unnamed Item
• Sensitivity analysis of the knapsack problem: a negative result
• Reoptimization of max \(k\)-cover: approximation ratio threshold
• On the complexity of postoptimality analysis of \(0/1\) programs
• Sensitivity analysis for knapsack problems: Another negative result
• Calculation of stability radii for combinatorial optimization problems
• The stability of the approximate Boolean minimization of a linear form
• Sensitivity analysis for knapsack problems: A negative result
• General approach to estimating the complexity of postoptimality analysis for discrete optimization problems
• Stability of solutions in problems of Boolean linear programming
• A Greedy Heuristic for the Set-Covering Problem

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