1. D. Fernandez-Baca and B. Venkatachalam, “Sensitivity analysis in combinatorial optimization,” in: T. Gonzalez (ed.), Handbook of Approximation Algorithms and Metaheuristics, Chapman&Hall/CRC Computer and Information Science Series, Boca Raton (2007), pp. 30.-1–30.-29.
2. V. K. Leontiev and K. Kh. Mamutov, “Stability of solutions in problems of Boolean linear programming,” Computational Mathematics and Mathematical Physics, 28, No. 10, 1475–1481 (1988)
3. Yu. N. Sotskov, “Stability analysis of an approximate solution of a Boolean problem of minimization of a linear form,” Computational Mathematics and Mathematical Physics, 33, No. 5, 785–795 (1993)
4. N. Chakravarti and A. P. M. Wagelmans, “Calculation of stability radii for combinatorial optimization problems,” Operations Research Letters, 23, 1–7 (1998).
5. I. V. Sergienko, Mathematical Models and Methods for Solving Discrete Optimization Problems [in Russian], Naukova Dumka, Kyiv (1985).