Solution of mixed combinatorial optimization problems on arrangements by the method of construction of lexicographic equivalence
type: Item
instance of: scholarly article
title: Solution of mixed combinatorial optimization problems on arrangements by the method of construction of lexicographic equivalence
zbMATH Open document ID: 1306.90125
author: T. N. Barbolina
published in: Cybernetics and Systems Analysis
publication date: 2014-10-27T00:00:00Z
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 6361691
zbMATH Keywords: multiset
zbMATH Keywords: mixed combinatorial Euclidean optimization problem
zbMATH Keywords: lexicographic enumeration
MaRDI profile type: Publication
full work available at URL: s10559-013-9582-4
OpenAlex ID: W2094465715
cites work: Solution of optimization problems with fractional-linear objective functions and additional linear constraints on permutations
cites work: Optimization of linear functions at the vertices of a permutation polyhedron with additional linear constraints
cites work: A modification of the method of combinatorial truncation in optimization problems over vertex-located sets
cites work: Q4455983
cites work: Q2933248
cites work: Solution of Euclidean combinatorial optimization problems by the method of construction of a lexicographic equivalence
cites work: Solving optimization problems with linear-fractional objective functions and additional constraints on the arrangements
cites work: Q4951277
DOI: 10.1007/S10559-013-9582-4
description: scientific article; zbMATH DE number 6361691