scientific article; zbMATH DE number 2168903

MaRDI QIDQ4675016zbMATH OpenFDO

Authors

Publication date 20 May 2005

zbMATH Keywords

combinatorial setsparametric optimizationpermutation polyhedronspolynomial method

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Combinatorial optimization (90C27)

Recommendations

• scientific article; zbMATH DE number 3939075
• The optimization of linear and convex functions on an Euclidean combinatorial set of polypermutations
• scientific article; zbMATH DE number 3865283
• An approach to solving discrete vector optimization problems over a combinatorial set of permutations
• Solving a linear problem of Euclidean combinatorial optimization on arrangements with the constant sum of the elements
• Solution of a Euclidean combinatorial optimization problem by the dynamic-programming method
• Theory and methods of Euclidian combinatorial optimization: current status and prospects
• Solution of Euclidean combinatorial optimization problems by the method of construction of a lexicographic equivalence
• Conditions for the strong solvability of optimization problems on permutations and their application.
• scientific article; zbMATH DE number 59441

Cited in

(10)

• A two-step method for solving vector optimization problems on permutation configuration
• The method of cutting the vertices of permutation polyhedron graph to solve linear conditional optimization problems on permutations
• A criterion for the adjacency of vertices of polytopes generated by subsets of symmetric groups
• Solution of Euclidean combinatorial optimization problems by the method of construction of a lexicographic equivalence
• scientific article; zbMATH DE number 4149894 (Why is no real title available?)
• Optimization on the combinatorial set of permutations in inexact input data conditions
• Conditions for the strong solvability of optimization problems on permutations and their application.
• scientific article; zbMATH DE number 4095215 (Why is no real title available?)
• Classes of lexicographic equivalence in Euclidean combinatorial optimisation on arrangements
• Convex solution of a permutation problem

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 Q4675016)