On a quantitative measure of stability for a vector problem in integer programming
From MaRDI portal
Publication:1571287
zbMath0964.90028MaRDI QIDQ1571287
Vladimir A. Emelichev, D. P. Podkopaev
Publication date: 19 July 2001
Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)
Related Items
The analysis of the stability of some integer programming algorithms with respect to the objective function, Stability and regularization of the lexicographic vector problem of quadratic discrete programming, Stability radius of a vector integer linear programming problem: Case of a regular norm in the space of criteria, General approach to estimating the complexity of postoptimality analysis for discrete optimization problems