On a quantitative measure of stability for a vector problem in integer programming
From MaRDI portal
Publication:1571287
zbMath0964.90028MaRDI QIDQ1571287
D. P. Podkopaev, Vladimir A. Emelichev
Publication date: 19 July 2001
Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)
Related Items
Unnamed Item, Estimation of the number of iterations in integer programming algorithms using the regular partitions method, Stability radius of a vector investment problem with Savage's minimax risk criteria, 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, On the quasistability radius for a multicriteria integer linear programming problem of finding extremum solutions