A graph-theoretic approach to multiobjective permutation-based optimization

DOI10.1007/978-3-030-38603-0_28MaRDI QIDQ1982918zbMATH OpenOpenAlexFDO

Authors Liudmyla Koliechkina, Oksana Pichugina, Sergiy Yakovlev

Publication date 14 September 2021

Full work available at URL https://doi.org/10.1007/978-3-030-38603-0_28

zbMATH Keywords

permutohedronconfiguration graphtransposition graphconvex extensionpermutation setstructural graphpermutation-based optimizationskeleton graphvertex located set

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Combinatorial optimization (90C27)

Recommendations

• Modified coordinate method to solve multicriteria optimization problems on combinatorial configurations
• The method of cutting the vertices of permutation polyhedron graph to solve linear conditional optimization problems on permutations
• Solving extremum problems with linear fractional objective functions on the combinatorial configuration of permutations under multicriteriality
• A two-step method for solving vector optimization problems on permutation configuration
• scientific article; zbMATH DE number 4149894

Cited in

(6)

• A two-step method for solving vector optimization problems on permutation configuration
• Modified coordinate method to solve multicriteria optimization problems on combinatorial configurations
• scientific article; zbMATH DE number 7070881 (Why is no real title available?)
• Continuous extensions on Euclidean combinatorial configurations
• The method of cutting the vertices of permutation polyhedron graph to solve linear conditional optimization problems on permutations
• scientific article; zbMATH DE number 3860886 (Why is no real title available?)

This page was built for publication: A graph-theoretic approach to multiobjective permutation-based optimization

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