Stability criteria in vector combinatorial bottleneck problems in terms of binary relations
type: Item
instance of: scholarly article
title: Stability criteria in vector combinatorial bottleneck problems in terms of binary relations
zbMATH Open document ID: 1143.90377
published in: Cybernetics and Systems Analysis
publication date: 2008-09-24T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C29
zbMATH DE Number: 5346518
zbMATH Keywords: vector combinatorial problem
zbMATH Keywords: bottleneck criterion
zbMATH Keywords: Pareto set
zbMATH Keywords: problem stability with respect to vector criterion
zbMATH Keywords: perturbing matrix
author: V. A. Emelichev
author: Kirill G. Kuzmin
MaRDI profile type: Publication
full work available at URL: s10559-008-9001-4
OpenAlex ID: W1983538867
cites work: Comparative analysis of different types of stability with respect to constraints of a vector integer-optimization problem
cites work: Stability of vector problems of integer optimization: relationship with the stability of sets of optimal and nonoptimal solutions
cites work: Stability of a vector integer quadratic programming problem with respect to vector criterion and constraints
cites work: Q4880741
cites work: An approach to the construction of approximate solutions of Boolean linear programming problems
cites work: Q4382651
cites work: Q3669130
cites work: Q4866423
cites work: Qualitative investigation of path problems
cites work: On the quasistability of trajectory problems of vector optimization
cites work: Stability analysis in optimization problems on matroids in the metric \(l_1\)
cites work: Stability of discrete vector problems with the parametric principle of optimality
DOI: 10.1007/S10559-008-9001-4
description: scientific article; zbMATH DE number 5346518