Stability criteria in vector combinatorial bottleneck problems in terms of binary relations

DOI10.1007/s10559-008-9001-4zbMath1143.90377OpenAlexW1983538867MaRDI QIDQ946781

Vladimir A. Emelichev, Kirill G. Kuzmin

Publication date: 24 September 2008

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10559-008-9001-4

zbMATH Keywords

Pareto setperturbing matrixbottleneck criterionproblem stability with respect to vector criterionvector combinatorial problem

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Combinatorial optimization (90C27)

Related Items (7)

Postoptimal analysis of the multicriteria combinatorial median location problem ⋮ Stability analysis of efficient portfolios in a discrete variant of multicriteria investment problem with Savage's risk criteria ⋮ Multicriteria investment problem with Savage's risk criteria: theoretical aspects of stability and case study ⋮ Postoptimal analysis of a vector minimax combinatorial problem ⋮ Uncertainty measure for the Bellman-Johnson problem with interval processing times ⋮ Estimating the Stability Radius of an Optimal Solution to the Simple Assembly Line Balancing Problem ⋮ Efficient computation of tolerances in the sensitivity analysis of combinatorial bottleneck problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Comparative analysis of different types of stability with respect to constraints of a vector integer-optimization problem
• On the quasistability of trajectory problems of vector optimization
• Stability analysis in optimization problems on matroids in the metric \(l_1\)
• Stability of a vector integer quadratic programming problem with respect to vector criterion and constraints
• Stability of discrete vector problems with the parametric principle of optimality
• Stability of vector problems of integer optimization: relationship with the stability of sets of optimal and nonoptimal solutions
• Qualitative investigation of path problems
• An approach to the construction of approximate solutions of Boolean linear programming problems

This page was built for publication: Stability criteria in vector combinatorial bottleneck problems in terms of binary relations