Article
Licensed
Unlicensed
Requires Authentication
On five types of stability of the lexicographic variant of the combinatorial bottleneck problem
-
E. E. Gurevskii
Published/Copyright:
October 19, 2009
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: 2008-08-28
Published Online: 2009-10-19
Published in Print: 2009-October
© de Gruyter 2009
You are currently not able to access this content.
You are currently not able to access this content.
Articles in the same Issue
- On five types of stability of the lexicographic variant of the combinatorial bottleneck problem
- On the limit distributions of the vertex degrees of conditional Internet graphs
- On the estimation of the periods of noisy binary periodic sequences
- On a constructive approach to the calculation of cardinality of the Ryser classes
- Positively closed classes of three-valued logic generated by one-place functions
- On combinatorial Gray codes with distance 3
- Optimal paths in oriented graphs and eigenvectors in max-⊗ systems
- The factorisation of one-generated partially foliated formations
- On finite lattices of topologies of commutative unary algebras
Articles in the same Issue
- On five types of stability of the lexicographic variant of the combinatorial bottleneck problem
- On the limit distributions of the vertex degrees of conditional Internet graphs
- On the estimation of the periods of noisy binary periodic sequences
- On a constructive approach to the calculation of cardinality of the Ryser classes
- Positively closed classes of three-valued logic generated by one-place functions
- On combinatorial Gray codes with distance 3
- Optimal paths in oriented graphs and eigenvectors in max-⊗ systems
- The factorisation of one-generated partially foliated formations
- On finite lattices of topologies of commutative unary algebras
