Unified Polynomial Dynamic Programming Algorithms for P-Center Variants in a 2D Pareto Front

Unified Polynomial Dynamic Programming Algorithms for P-Center Variants in a 2D Pareto Front

With many efficient solutions for a multi-objective optimization problem, this paper aims to cluster the Pareto Front in a given number of clusters <i>K</i> and to detect isolated points. <i>K</i>-center problems and variants are investigated with a unified formulation consid...

Full description

Bibliographic Details
Main Authors: Nicolas Dupin, Frank Nielsen, El-Ghazali Talbi
Format: Article
Language:English
Published: MDPI AG 2021-02-01
Series:Mathematics
Subjects:
discrete optimization
operational research
computational geometry
complexity
algorithms
dynamic programming
Online Access:https://www.mdpi.com/2227-7390/9/4/453

Internet

https://www.mdpi.com/2227-7390/9/4/453

Similar Items