POLYNOMIAL ALGORITHMS FOR P-DISPERSION PROBLEMS IN A PLANAR PARETO FRONT
In this paper, P-dispersion problems are studied to select P > 2 representative points from a large 2D Pareto Front (PF), solution of bi-objective optimization. Four standard P-dispersion variants are considered. A novel variant, Max-Sum-Neighbor P-dispersion, is introduced for the specific case...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
EDP Sciences
2023
|
| Subjects: | |
| Online Access: | View Fulltext in Publisher View in Scopus |