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

DOI10.1007/S10559-014-9649-XMaRDI QIDQ2263322zbMATH OpenOpenAlexFDO

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

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

linear optimization on permutationsmethod of cutting graph verticespermutation polyhedron graphset of permutations

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 2168903
• scientific article; zbMATH DE number 4149894
• Solving linear conditional completely combinatorial optimization problems on permutations by the branch and bound method
• Linear optimization over permutation groups
• A graph-theoretic approach to multiobjective permutation-based optimization

Cites work

• A modification of the method of combinatorial truncation in optimization problems over vertex-located sets
• Cut-off in linear partially combinatorial problems of Euclidean combinatorial optimization
• scientific article; zbMATH DE number 3828714 (Why is no real title available?)
• scientific article; zbMATH DE number 3801290 (Why is no real title available?)
• scientific article; zbMATH DE number 2118654 (Why is no real title available?)
• scientific article; zbMATH DE number 1450273 (Why is no real title available?)
• Method of ordering the values of a linear function on a set of permutations

Cited in

(6)

• A graph-theoretic approach to multiobjective permutation-based optimization
• Theory and methods of Euclidian combinatorial optimization: current status and prospects
• scientific article; zbMATH DE number 3860886 (Why is no real title available?)
• scientific article; zbMATH DE number 4149894 (Why is no real title available?)
• Solving linear conditional completely combinatorial optimization problems on permutations by the branch and bound method
• The polyhedral-surface cutting plane method of optimization over a vertex-located set

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

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