|
This article is cited in 6 scientific papers (total in 6 papers)
On five types of stability of the lexicographic variant of the combinatorial bottleneck problem
E. E. Gurevskii, V. A. Emelichev
Abstract:
We consider the combinatorial vector minimax problem with ordered criteria. We formulate necessary and sufficient conditions for the five known types of stability of the problem which describe the behaviour of the lexicographic set with respect to perturbations of the initial data for the vector criterion.
Received: 28.08.2008
Citation:
E. E. Gurevskii, V. A. Emelichev, “On five types of stability of the lexicographic variant of the combinatorial bottleneck problem”, Diskr. Mat., 21:3 (2009), 3–13; Discrete Math. Appl., 19:4 (2009), 337–348
Linking options:
https://www.mathnet.ru/eng/dm1056https://doi.org/10.4213/dm1056 https://www.mathnet.ru/eng/dm/v21/i3/p3
|
Statistics & downloads: |
Abstract page: | 630 | Full-text PDF : | 218 | References: | 62 | First page: | 18 |
|