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

DOI10.1007/s10559-009-9110-8zbMath1178.90297OpenAlexW2054914201MaRDI QIDQ1040407

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 optimizationPareto-optimal solutionsmulticriterion optimizationcombinatorial setspolyarrangementsweakly and strongly efficient solutions

Mathematics Subject Classification ID

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

Related Items (5)

A method to solve conditional optimization problems with quadratic objective functions on the set of permutations ⋮ Continuous representations and functional extensions in combinatorial optimization ⋮ Description and generation of permutations containing cycles ⋮ Generating combinatorial sets with given properties ⋮ A two-step method for solving vector optimization problems on permutation configuration

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An approach to solving discrete vector optimization problems over a combinatorial set of permutations
• Stability of vector problems of integer optimization: relationship with the stability of sets of optimal and nonoptimal solutions
• Polyhedral techniques in combinatorial optimization II: applications and computations
• Polyhedral techniques in combinatorial optimization I: Theory
• Existence of solutions in vector optimization problems

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