Solution of Euclidean combinatorial optimization problems by the method of construction of a lexicographic equivalence

DOI10.1007/S10559-005-0010-2MaRDI QIDQ2574244zbMATH OpenOpenAlexFDO

Authors O. A. Yemets', T. N. Barbolina

Publication date 18 November 2005

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

Full work available at URL https://doi.org/10.1007/s10559-005-0010-2

zbMATH Keywords

Euclidean optimization problemlexicographic exhaustive searchmultiset

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Recommendations

• Classes of lexicographic equivalence in Euclidean combinatorial optimisation on arrangements
• Solution of mixed combinatorial optimization problems on arrangements by the method of construction of lexicographic equivalence
• Theory and methods of Euclidian combinatorial optimization: current status and prospects
• Lexicographic equivalence in mixed combinatorial optimization of linear-fractional functions on arrangements
• scientific article; zbMATH DE number 2168903

Cites work

• Application of regular partitions in integer programming
• scientific article; zbMATH DE number 1524443 (Why is no real title available?)
• scientific article; zbMATH DE number 1438952 (Why is no real title available?)

Cited in

(8)

• Solving optimization problems with linear-fractional objective functions and additional constraints on the arrangements
• Analysis of an algorithm for solution of conditional optimization problems with linear-fractional objective functions over permutations
• TWO CHARACTERISATIONS OF THE LEXICOGRAPHIC EGALITARIAN SOLUTION
• Direct cut-off method for combinatorial optimization problems with additional constraints
• Solution of mixed combinatorial optimization problems on arrangements by the method of construction of lexicographic equivalence
• scientific article; zbMATH DE number 2168903 (Why is no real title available?)
• Classes of lexicographic equivalence in Euclidean combinatorial optimisation on arrangements
• Lexicographic equivalence in mixed combinatorial optimization of linear-fractional functions on arrangements

This page was built for publication: Solution of Euclidean combinatorial optimization problems by the method of construction of a lexicographic equivalence

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2574244)