Publisher
Springer Science and Business Media LLC
Reference10 articles.
1. L. N. Kozeratskaya, T. T. Lebedeva, and I. V. Sergienko, “Stability, parametric, and postoptimality analysis of discrete optimization problems,” Cybernetics, 19, No. 4, 522–534 (1983).
2. I. V. Sergienko and V. P. Shilo, Discrete Optimization Problems: Challenges, Solution Methods, and Studies [in Russian], Naukova Dumka, Kyiv (2003).
3. A. M. Geoffrion and R. Nauss, “Parametric and postoptimality analysis in integer linear programming,” Management Science, 23, No. 5, 453–466 (1977).
4. G. M. Roodman, “Postoptimality analysis in zero one programming by implicit enumeration,” Naval Res. Logist. Quart., 19, No. 3, 435–447 (1972).
5. V. A. Mikhailyuk, “General approach to estimating the complexity of postoptimality analysis for discrete optimization problem,” Cybernetics and Systems Analysis, 46, No. 2, 290–295 (2010).