# ------------------------------------------------
# CITATION.cff file created with {cffr} R package
# See also: https://docs.ropensci.org/cffr/
# ------------------------------------------------
 
cff-version: 1.2.0
message: 'To cite package "Coreset" in publications use:'
type: software
license: GPL-3.0-or-later
title: 'Coreset: Discrete Diversity, Dispersion, and Coverage Subset Selection'
version: 1.0.0.9004
doi: 10.32614/CRAN.package.Coreset
identifiers:
- type: doi
  value: 10.32614/CRAN.package.Coreset
abstract: 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) <https://doi.org/10.1016/0304-3975(85)90224-5>; the DropAdd
  tabu-search heuristic (Porumbel, Hao & Glover 2011) <https://doi.org/10.1007/s10479-011-0898-z>,
  GRASP with path-relinking (Resende, Marti, Gallego & Duarte 2010) <https://doi.org/10.1016/j.cor.2008.05.011>,
  and an exact node-packing integer program (Sayyady & Fathi 2016) <https://doi.org/10.1016/j.ejor.2016.02.026>.
  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) <https://doi.org/10.3934/jimo.2020115>.
  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 <https://doi.org/10.1007/s10732-017-9345-x>,
  2019 <https://doi.org/10.1109/ACCESS.2019.2933875>), 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 & Wynn 1987 <https://doi.org/10.1080/02664768700000020>;
  the mode of a determinantal point process, Kulesza & Taskar 2012 <https://doi.org/10.1561/2200000044>),
  is solved by greedy pivoted-Cholesky selection and, for small instances, exact enumeration.
authors:
- family-names: Smith
  given-names: Martin R.
  email: martin.smith@durham.ac.uk
  orcid: https://orcid.org/0000-0001-5660-1727
preferred-citation:
  type: manual
  title: 'Coreset: Discrete Diversity, Dispersion, and Coverage Subset Selection'
  authors:
  - family-names: Smith
    given-names: Martin R.
    email: martin.smith@durham.ac.uk
    orcid: https://orcid.org/0000-0001-5660-1727
  notes: R package version 1.0.0.9004
  year: '2026'
  url: https://ms609.github.io/Coreset/
  doi: 10.32614/CRAN.package.Coreset
  institution:
    name: Comprehensive R Archive Network
    address: Vienna
repository: https://ms609.r-universe.dev
repository-code: https://github.com/ms609/Coreset
commit: 5fe6af14c3a5441abeea55aae2ed211232d074bc
url: https://ms609.github.io/Coreset/
date-released: '2026-10-07'
contact:
- family-names: Smith
  given-names: Martin R.
  email: martin.smith@durham.ac.uk
  orcid: https://orcid.org/0000-0001-5660-1727