A polyhedral approach to solving multicriterion combinatorial optimization problems over sets of polyarrangements

DOI10.1007/S10559-009-9110-8MaRDI QIDQ1040407zbMATH OpenOpenAlexFDO

Authors N. V. Semenova, L. N. Kolechkina

Publication date 24 November 2009

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

Full work available at URL https://doi.org/10.1007/s10559-009-9110-8

zbMATH Keywords

discrete optimizationmulticriterion optimizationPareto-optimal solutionscombinatorial setspolyarrangementsweakly and strongly efficient solutions

Mathematics Subject Classification ID

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

Recommendations

• A polyhedral approach to the solution of a class of vector problems of combinatorial optimization
• Solution of multicriteria problems of combinatorial optimization on a set of polypermutations
• Multicriteria combinatorial optimization problems on a set of polypermutations
• An approach to solving discrete vector optimization problems over a combinatorial set of permutations
• scientific article; zbMATH DE number 1157223

Cites work

• scientific article; zbMATH DE number 2059035 (Why is no real title available?)
• scientific article; zbMATH DE number 1537567 (Why is no real title available?)
• scientific article; zbMATH DE number 3801290 (Why is no real title available?)
• scientific article; zbMATH DE number 892018 (Why is no real title available?)
• An approach to solving discrete vector optimization problems over a combinatorial set of permutations
• Existence of solutions in vector optimization problems
• Polyhedral techniques in combinatorial optimization I: Theory
• Polyhedral techniques in combinatorial optimization II: applications and computations
• Solution of multicriteria problems of combinatorial optimization on a set of polypermutations
• Stability of vector problems of integer optimization: relationship with the stability of sets of optimal and nonoptimal solutions

Cited in

(9)

• scientific article; zbMATH DE number 5823944 (Why is no real title available?)
• A two-step method for solving vector optimization problems on permutation configuration
• Multicriteria combinatorial optimization problems on a set of polypermutations
• A polyhedral approach to the solution of a class of vector problems of combinatorial optimization
• Solution of multicriteria problems of combinatorial optimization on a set of polypermutations
• A method to solve conditional optimization problems with quadratic objective functions on the set of permutations
• Description and generation of permutations containing cycles
• Continuous representations and functional extensions in combinatorial optimization
• Generating combinatorial sets with given properties

This page was built for publication: A polyhedral approach to solving multicriterion combinatorial optimization problems over sets of polyarrangements

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