Unified Polynomial Dynamic Programming Algorithms for P-Center Variants in a 2D Pareto Front - Dupin, Nicolas; Nielsen, Frank; Talbi, El-Ghazali (Mathematics, 2021)
Keywords: [INFO.INFO-CC] Computer Science [cs]/Computational Complexity [cs.CC]; [INFO.INFO-CG] Computer Science [cs]/Computational Geometry [cs.CG]; [INFO.INFO-RO] Computer Science [cs]/Operations Research [math.OC]; [INFO.INFO-RO]Computer Science [cs]/Operations Research [cs.RO]; [INFO]Computer Science [cs]; [MATH.MATH-OC]Mathematics [math]/Optimization and Control [math.OC]; Algorithms; bi-objective optimization; Clustering; Complexity; Computational Complexity; Computational Geometry; Computer Science; Discrete optimization; Dynamic programming; Food science; K-center; Linear programming; Mathematics; Multiple objective analysis; Objectives; Operational research; Operations Research; Optimization; Optimization and Control; P-center; Parallel programming; Pareto Front; Pareto optimization; Polynomials; QA1-939; Sum-diameter clustering; sum-radii clustering; Operational research; Clustering; Pareto Front; Complexity; Sum-diameter clustering; Computational geometry; Bi-objective optimization; Parallel programming; Algorithms; K-center; Discrete optimization; Sum-radii clustering; P-center; Dynamic programming