The stability of the approximate Boolean minimization of a linear form

zbMATH Open0799.90110MaRDI QIDQ1323967FDOQ1323967

Authors: Yuri N. Sotskov 

Publication date: 6 July 1994

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

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

zbMATH Keywords

discrete extremal problemsradius of stability\(\varepsilon\)-approximate solution

Mathematics Subject Classification ID

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

Cited In (11)

• Stability of a routing optimization algorithm
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Some concepts of stability analysis in combinatorial optimization
• Extending single tolerances to set tolerances
• On the complexity of postoptimality analysis of \(0/1\) programs
• On the complexity of calculating sensitivity parameters in Boolean programming problems
• Title not available (Why is that?)
• An approach to the construction of approximate solutions of Boolean linear programming problems
• Analyse de sensibilité pour les problèmes linéaires en variables 0-1

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)