Method of ordering the values of a linear function on a set of permutations

DOI10.1007/S10559-009-9092-6zbMath1187.68335OpenAlexW2086570044MaRDI QIDQ1040370

L. N. Kolechkina, Georg A. Donets

Publication date: 24 November 2009

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

Full work available at URL: https://doi.org/10.1007/s10559-009-9092-6

zbMATH Keywords

set of permutationsgraphsHamiltonian pathpermutation polyhedroncombinatorial setshyperfaces

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Permutations, words, matrices (05A05)

Related Items (10)

Properties of the linear unconditional problem of combinatorial optimization on arrangements under probabilistic uncertainty ⋮ Solving linear unconstrained problems of combinatorial optimization on arrangements under stochastic uncertainty ⋮ Construction of Hamiltonian paths in graphs of permutation polyhedra ⋮ A method to solve conditional optimization problems with quadratic objective functions on the set of permutations ⋮ Direct cut-off method for combinatorial optimization problems with additional constraints ⋮ Lexicographic equivalence in mixed combinatorial optimization of linear-fractional functions on arrangements ⋮ Description and generation of permutations containing cycles ⋮ Generating combinatorial sets with given properties ⋮ The method of cutting the vertices of permutation polyhedron graph to solve linear conditional optimization problems on permutations ⋮ Modified coordinate method to solve multicriteria optimization problems on combinatorial configurations

Cites Work

• An approach to solving discrete vector optimization problems over a combinatorial set of permutations
• Unnamed Item

This page was built for publication: Method of ordering the values of a linear function on a set of permutations