Lexicographic equivalence in mixed combinatorial optimization of linear-fractional functions on arrangements

DOI10.1007/S10559-017-9924-8zbMath1392.90097OpenAlexW2602847420MaRDI QIDQ681902

T. M. Barbolina, O. O. Iemets

Publication date: 13 February 2018

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

Full work available at URL: https://doi.org/10.1007/s10559-017-9924-8

zbMATH Keywords

Euclidian problem of combinatorial optimizationlexicographic equivalencelinear-fractional functionoptimization problem on arrangements

Mathematics Subject Classification ID

Fractional programming (90C32) Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Solution of mixed combinatorial optimization problems on arrangements by the method of construction of lexicographic equivalence
• Classification of applied methods of combinatorial optimization
• Method of ordering the values of a linear function on a set of 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

This page was built for publication: Lexicographic equivalence in mixed combinatorial optimization of linear-fractional functions on arrangements