Algorithmic solution of two parametric optimization problems of a set of complete combinations
type: Item
instance of: scholarly article
title: Algorithmic solution of two parametric optimization problems of a set of complete combinations
zbMATH Open document ID: 0985.90086
DOI: 10.1007/BF02742292
author: A. A. Roskladka
author: O. A. Yemets
published in: Cybernetics and Systems Analysis
publication date: 2001-05-02T00:00:00Z
Mathematics Subject Classification ID: 90C31
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 1517629
zbMATH Keywords: discrete-optimization problem
zbMATH Keywords: multiset
zbMATH Keywords: objective function
zbMATH Keywords: parametric analysis
MaRDI profile type: MaRDI publication profile
cites work: Q4880741
cites work: Stability and unboundedness of vector optimization problems
cites work: Stability of discrete optimization problems
cites work: Stability, parametric, and postoptimality analysis of discrete optimization problems
cites work: Set of strictly efficient points of mixed integer vector optimization problem as a measure of problem's stability
cites work: Stability in vector optimization path problems
cites work: Q3882292
cites work: Parametric trajectory problems
cites work: A general approach to the study of the stability of solutions in discrete optimization problems
cites work: Q3050437
cites work: Q3994612
Recommended article: Q4674994
Recommended article: Q4828110
Recommended article: Solution of multicriteria problems of combinatorial optimization on a set of polypermutations
Recommended article: Multicriteria combinatorial optimization problems on a set of polypermutations
Recommended article: On combinatorial vector optimization problems
description: scientific article; zbMATH DE number 1517629