Author:
Mikhailyuk V. A.,Lishchuk N. V.
Publisher
Springer Science and Business Media LLC
Reference8 articles.
1. D. Fernandez-Baca and B. Benkatachalam, “Sensitivity analysis in combinatorial optimization,” in: T. Guzalez (ed.), Handbook of Approximation Algorithms and Metaheuristics, Chapman&Hall/CRC Comput. Inform. Sci. Ser. (2007), pp. 30-1–30-29.
2. S. Van Hoesel and A. Wagelmans, “On the complexity of postoptimality analysis of 0/1 programs,” Discrete Appl. Mathemat., 91, 251–263 (1999).
3. C. Blair, “Sensitivity analysis for knapsack problems: A negative result,” Discrete Appl. Mathemat., 81, 133–139 (1998).
4. M. Gary and D. Johnson, Computers and Difficult Problems [Russian translation], Mir, Moscow (1982).
5. V. A. Mikhailyuk, “General approach to estimating the complexity of postoptimality analysis for discrete optimization problems,” Cybernetics and Systems Analysis, 46, No. 2, 290–295 (2010).
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献