A novel graph-theoretical clustering approach to find a reduced set with extreme solutions of Pareto optimal solutions for multi-objective optimization problems (Q6162515): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/s10898-023-01275-y / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S10898-023-01275-Y / rank | |||
Normal rank | |||
Latest revision as of 19:01, 30 December 2024
scientific article; zbMATH DE number 7704019
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A novel graph-theoretical clustering approach to find a reduced set with extreme solutions of Pareto optimal solutions for multi-objective optimization problems |
scientific article; zbMATH DE number 7704019 |
Statements
A novel graph-theoretical clustering approach to find a reduced set with extreme solutions of Pareto optimal solutions for multi-objective optimization problems (English)
0 references
28 June 2023
0 references
multi-objective optimization
0 references
Pareto optimal solutions
0 references
clustering
0 references
graph theory
0 references
connectivity
0 references
silhouette score
0 references
0 references
