Decremental Clustering for the Solution of p-Dispersion Problems to Proven Optimality | Zendy

Claudio Contardo | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Decremental Clustering for the Solution of p-Dispersion Problems to Proven Optimality

Author(s) -

Claudio Contardo

Publication year - 2020

Publication title -

informs journal on optimization

Language(s) - English

Resource type - Journals

eISSN - 2575-1492

pISSN - 2575-1484

DOI - 10.1287/ijoo.2019.0027

Subject(s) - solver , cluster analysis , series (stratigraphy) , integer (computer science) , mathematics , combinatorics , state (computer science) , matrix (chemical analysis) , construct (python library) , dispersion (optics) , algorithm , computer science , mathematical optimization , discrete mathematics , statistics , physics , paleontology , materials science , optics , composite material , biology , programming language

Given n points, a symmetric dissimilarity matrix D of dimensions n × n, and an integer p ? 2, the p-dispersion problem (pDP) consists of selecting a subset of exactly p points in such a way that th...

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research