The stability of the approximate Boolean minimization of a linear form

MaRDI QIDQ1323967zbMATH OpenFDO

Authors Yuri N. Sotskov

Publication date 6 July 1994

Published in Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

zbMATH Keywords

\(\varepsilon\)-approximate solutiondiscrete extremal problemsradius of stability

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 781252
• Publication:3477568
• scientific article; zbMATH DE number 1294371
• The stability radius of an efficient solution in minimax Boolean programming problem
• Stability analysis of lexicographic Boolean minimization problem for the moduli of linear functions

Cited in

(12)

• Stability of a routing optimization algorithm
• On the complexity of postoptimality analysis of 0/1 programs
• Extending single tolerances to set tolerances
• Some concepts of stability analysis in combinatorial optimization
• scientific article; zbMATH DE number 4146949 (Why is no real title available?)
• scientific article; zbMATH DE number 5620805 (Why is no real title available?)
• An approach to the construction of approximate solutions of Boolean linear programming problems
• scientific article; zbMATH DE number 1294371 (Why is no real title available?)
• scientific article; zbMATH DE number 781252 (Why is no real title available?)
• scientific article; zbMATH DE number 5251017 (Why is no real title available?)
• Analyse de sensibilité pour les problèmes linéaires en variables 0-1
• On the complexity of calculating sensitivity parameters in Boolean programming problems

This page was built for publication: The stability of the approximate Boolean minimization of a linear form

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