Solution of mixed combinatorial optimization problems on arrangements by the method of construction of lexicographic equivalence

DOI10.1007/s10559-013-9582-4zbMath1306.90125OpenAlexW2094465715MaRDI QIDQ466438

T. N. Barbolina

Publication date: 27 October 2014

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

Full work available at URL: https://doi.org/10.1007/s10559-013-9582-4

zbMATH Keywords

multisetlexicographic enumerationmixed combinatorial Euclidean optimization problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items (2)

Properties of the linear unconditional problem of combinatorial optimization on arrangements under probabilistic uncertainty ⋮ Lexicographic equivalence in mixed combinatorial optimization of linear-fractional functions on arrangements

Cites Work

• A modification of the method of combinatorial truncation in optimization problems over vertex-located sets
• Solution of optimization problems with fractional-linear objective functions and additional linear constraints on permutations
• Solving optimization problems with linear-fractional objective functions and additional constraints on the arrangements
• Solution of Euclidean combinatorial optimization problems by the method of construction of a lexicographic equivalence
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Solution of mixed combinatorial optimization problems on arrangements by the method of construction of lexicographic equivalence