THE METHOD OF CUTTING THE VERTICES OF PERMUTATION POLYHEDRON GRAPH TO SOLVE LINEAR CONDITIONAL OPTIMIZATION PROBLEMS ON PERMUTATIONS

摘要

The method of cutting the vertices of the permutation polyhedron graph is proposed for the solution of linear conditional optimization problems on permutations. The concepts of the permutation polyhedron graph and of partial graph of the set of permutations are introduced. The numerical experiments based on the created software implementation of the algorithm are described.