The method of cutting the vertices of permutation polyhedron graph to solve linear conditional optimization problems on permutations

DOI10.1007/s10559-014-9649-xzbMath1308.90205OpenAlexW1981053048MaRDI QIDQ2263322

O. O. Iemets, D. M. Olhovskiy, E. M. Yemets

Publication date: 18 March 2015

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

Full work available at URL: https://doi.org/10.1007/s10559-014-9649-x

zbMATH Keywords

set of permutationslinear optimization on permutationsmethod of cutting graph verticespermutation polyhedron graph

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Linear programming (90C05) Combinatorial optimization (90C27)

Related Items (1)

Theory and methods of Euclidian combinatorial optimization: current status and prospects

Cites Work

• A modification of the method of combinatorial truncation in optimization problems over vertex-located sets
• Method of ordering the values of a linear function on a set of permutations
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The method of cutting the vertices of permutation polyhedron graph to solve linear conditional optimization problems on permutations