Package: turfLP
Title: TURF Analysis with Integer Linear Programming
Version: 0.2.0
Authors@R: 
  c(
    person("John", "Ennis", , "john.m.ennis@aigora.com", role = c("aut", "cre")),
    person("Aigora", role = c("cph", "fnd"))
  )
Description: Finds product portfolios that maximize TURF (total
        unduplicated reach and frequency) with integer linear
        programming, following Serra (2013)
        <doi:10.1016/j.foodqual.2012.10.001>. The maximum reach problem
        is the maximal covering location problem of Church and ReVelle
        (1974) <doi:10.1007/BF01942293>. The package solves it as an
        integer linear program, so it finds exact optima without
        enumerating every portfolio. Ties on reach are broken by
        frequency and then by the harmonic mean of the individual
        product reaches. The package also finds the smallest portfolio
        that reaches every reachable respondent. For related work on
        TURF for large data sets, see Ennis, Fayle, and Ennis (2012)
        <doi:10.1016/j.foodqual.2011.06.004>.
License: MIT + file LICENSE
Copyright: See the file COPYRIGHTS.
URL: https://github.com/aigorahub/turfLP
BugReports: https://github.com/aigorahub/turfLP/issues
Depends: R (>= 3.5.0)
Imports: highs (>= 1.14.0), Matrix, stats
Suggests: testthat (>= 3.0.0)
Config/testthat/edition: 3
Encoding: UTF-8
Language: en-US
Roxygen: list(markdown = TRUE)
Config/roxygen2/version: 8.1.0
LazyData: true
Config/pak/sysreqs: cmake pkg-config
Repository: https://aigorahub.r-universe.dev
Date/Publication: 2026-10-12 21:20:54 UTC
RemoteUrl: https://github.com/aigorahub/turflp
RemoteRef: HEAD
RemoteSha: 9e6e7e569c07c53f338b7da817cdb59880110959
NeedsCompilation: no
Packaged: 2026-10-12 23:24:03 UTC; root
Author: John Ennis [aut, cre],
  Aigora [cph, fnd]
Maintainer: John Ennis <john.m.ennis@aigora.com>