A novel graph-theoretical clustering approach to find a reduced set with extreme solutions of Pareto optimal solutions for multi-objective optimization problems

DOI10.1007/s10898-023-01275-yzbMath1527.90202MaRDI QIDQ6162515

Sondoss Elsawah, Sanath Kahagalage, Hasan Hüseyin Turan, Fatemeh Jalalvand

Publication date: 28 June 2023

Published in: Journal of Global Optimization (Search for Journal in Brave)

zbMATH Keywords

multi-objective optimizationclusteringgraph theoryconnectivityPareto optimal solutionssilhouette score

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The analytic hierarchy process—what it is and how it is used
• SMS-EMOA: multiobjective selection based on dominated hypervolume
• Effective implementation of the \(\varepsilon \)-constraint method in multi-objective mathematical programming problems
• Silhouettes: a graphical aid to the interpretation and validation of cluster analysis
• Combining ranking scales and selecting variables in the DEA context: The case of industrial branches.
• Early identification of an impending rockslide location via a spatially-aided Gaussian mixture model
• Pruning Pareto optimal solutions for multi-objective portfolio asset management
• Multi-Terminal Network Flows
• Graph Clustering and Minimum Cut Trees
• Dynamic Graph Clustering Using Minimum-Cut Trees

This page was built for publication: A novel graph-theoretical clustering approach to find a reduced set with extreme solutions of Pareto optimal solutions for multi-objective optimization problems