<?xml version="1.0" encoding="UTF-8"?>
<oai_dc:dc xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:title>Discrete Diversity, Dispersion, and Coverage Subset Selection</dc:title>
  <dc:title>R package Coreset version 1.0.0</dc:title>
  <dc:description>Solves discrete location objectives on a distance matrix or
  Euclidean coordinate set. The Max-Min Diversity (MMDP / p-dispersion)
  objective, which maximizes the minimum pairwise distance within a selection
  of k items, is solved by farthest-first selection (Gonzalez 1985)
  &lt;doi:10.1016/0304-3975(85)90224-5&gt;; the DropAdd tabu-search heuristic
  (Porumbel, Hao &amp; Glover 2011) &lt;doi:10.1007/s10479-011-0898-z&gt;, GRASP with 
  path-relinking (Resende, Marti, Gallego &amp; Duarte 2010)
  &lt;doi:10.1016/j.cor.2008.05.011&gt;, and an exact node-packing integer program
  (Sayyady &amp; Fathi 2016) &lt;doi:10.1016/j.ejor.2016.02.026&gt;.
  The Max-Mean Dispersion objective, which selects a subset of
  unrestricted size maximising the sum of its pairwise distances divided by the
  number of selected elements, is solved by reinforcement-learning-guided tabu
  search (Nijimbere et al. 2020) &lt;doi:10.3934/jimo.2020115&gt;.
  The discrete k-centre (min-max covering / facility location) objective,
  which chooses k centres to minimise the largest distance from any point to
  its nearest centre, is solved via the CDSh heuristic (Garcia-Diaz et al.
  2017 &lt;doi:10.1007/s10732-017-9345-x&gt;, 2019 &lt;doi:10.1109/ACCESS.2019.2933875&gt;),
  and an exact minimum-cover integer program. The maximum-entropy (maxdet)
  objective, which maximises the log-determinant of a similarity kernel built
  from the distances (Shewry &amp; Wynn 1987 &lt;doi:10.1080/02664768700000020&gt;; the
  mode of a determinantal point process, Kulesza &amp; Taskar 2012
  &lt;doi:10.1561/2200000044&gt;), is solved by greedy pivoted-Cholesky selection and,
  for small instances, exact enumeration.</dc:description>
  <dc:type>Software</dc:type>
  <dc:relation>Depends: R (&gt;= 4.1)</dc:relation>
  <dc:relation>Imports: cli (&gt;= 3.0.0), Rcpp, Rdpack (&gt;= 0.7), stats</dc:relation>
  <dc:relation>LinkingTo: Rcpp</dc:relation>
  <dc:relation>Suggests: highs, knitr, Matrix, quarto, rprojroot, spelling, testthat
(&gt;= 3.0.0)</dc:relation>
  <dc:creator>Martin R. Smith &lt;martin.smith@durham.ac.uk&gt;</dc:creator>
  <dc:publisher>Comprehensive R Archive Network (CRAN)</dc:publisher>
  <dc:contributor>Martin R. Smith [aut, cre, cph] (ORCID:
    &lt;https://orcid.org/0000-0001-5660-1727&gt;)</dc:contributor>
  <dc:rights>GPL (&gt;= 3)</dc:rights>
  <dc:date>2026-09-17</dc:date>
  <dc:format>application/tgz</dc:format>
  <dc:identifier>https://CRAN.R-project.org/package=Coreset</dc:identifier>
  <dc:identifier>doi:10.32614/CRAN.package.Coreset</dc:identifier>
  <dc:language>en-GB</dc:language>
</oai_dc:dc>
