On five types of stability of the lexicographic variant of the combinatorial bottleneck problem

DOI10.1515/DMA.2009.022zbMath1261.90043MaRDI QIDQ3225880

E. E. Gurevskii, Vladimir A. Emelichev

Publication date: 23 March 2012

Published in: Discrete Mathematics and Applications (Search for Journal in Brave)

zbMATH Keywords

vector minimax problemtypes of stability

Mathematics Subject Classification ID

Sensitivity, stability, parametric optimization (90C31) Combinatorial optimization (90C27)

Related Items (1)

On one approach to TSP structural stability

Cites Work

• 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
• Some concepts of stability analysis in combinatorial optimization
• Stability of a vector integer quadratic programming problem with respect to vector criterion and constraints
• Boolean problem of sequential minimization of moduli of linear functions and stability theorems
• Stability of vector problems of integer optimization: relationship with the stability of sets of optimal and nonoptimal solutions
• On the strong stability of a vector trajectorial problem of the lexicographic optimization
• On the radii of steadiness, quasi-steadiness, and stability of a vector trajectory problem on lexicographic optimization
• Stability and Regularization of Vector Problems of Integer Linear Programming
• On combinatorial vector optimization problems

This page was built for publication: On five types of stability of the lexicographic variant of the combinatorial bottleneck problem