scientific article; zbMATH DE number 4149894

MaRDI QIDQ3479812zbMATH OpenFDO

Authors Sergey Yakovlev, O. V. Parshin

Publication date 1989

zbMATH Keywords

approximate methodspermutation polytope

Mathematics Subject Classification ID

(n)-dimensional polytopes (52B11) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Integer programming (90C10)

Recommendations

• The optimization of linear and convex functions on an Euclidean combinatorial set of polypermutations
• The method of cutting the vertices of permutation polyhedron graph to solve linear conditional optimization problems on permutations
• scientific article; zbMATH DE number 4049390
• scientific article; zbMATH DE number 4127014
• scientific article; zbMATH DE number 2168903

Cited in

(12)

• Pivoting in an outcome polyhedron
• The optimization of linear and convex functions on an Euclidean combinatorial set of polypermutations
• A graph-theoretic approach to multiobjective permutation-based optimization
• Permutatorial optimization via the permutahedron
• The method of cutting the vertices of permutation polyhedron graph to solve linear conditional optimization problems on permutations
• L_p-norm regularization algorithms for optimization over permutation matrices
• scientific article; zbMATH DE number 3906242 (Why is no real title available?)
• scientific article; zbMATH DE number 3961323 (Why is no real title available?)
• scientific article; zbMATH DE number 4049390 (Why is no real title available?)
• scientific article; zbMATH DE number 2124592 (Why is no real title available?)
• Convex solution of a permutation problem
• The polyhedral-surface cutting plane method of optimization over a vertex-located set

This page was built for publication:

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