On five types of stability of the lexicographic variant of the combinatorial bottleneck problem
From MaRDI portal
Publication:3225880
DOI10.1515/DMA.2009.022zbMATH Open1261.90043MaRDI QIDQ3225880FDOQ3225880
Authors: E. E. Gurevskii, V. A. Emelichev 
Publication date: 23 March 2012
Published in: Discrete Mathematics and Applications (Search for Journal in Brave)
Recommendations
- Some forms of stability of a combinatorial problem of lexicographic optimization
- scientific article; zbMATH DE number 6007859
- Stability criteria in vector combinatorial bottleneck problems in terms of binary relations
- On the stability kernel of a multicriteria combinatorial minimax problem
- Stability conditions for the vector path problem in lexicographic discrete optimization
Cites Work
- Some concepts of stability analysis in combinatorial optimization
- Stability and Regularization of Vector Problems of Integer Linear Programming
- On combinatorial vector optimization problems
- Stability of a vector integer quadratic programming problem with respect to vector criterion and constraints
- Stability of vector problems of integer optimization: relationship with the stability of sets of optimal and nonoptimal solutions
- Comparative analysis of different types of stability with respect to constraints of a vector integer-optimization problem
- Different types of stability of vector integer optimization problem: General approach
- On the radii of steadiness, quasi-steadiness, and stability of a vector trajectory problem on lexicographic optimization
- Boolean problem of sequential minimization of moduli of linear functions and stability theorems
- On the strong stability of a vector trajectorial problem of the lexicographic optimization
Cited In (3)
This page was built for publication: On five types of stability of the lexicographic variant of the combinatorial bottleneck problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3225880)
