https://john-aigora.r-universe.devRecent package updates in john-aigoraR-universehttps://github.com/john-aigora.pnghttps://john-aigora.r-universe.devThu, 22 Oct 2026 03:28:56 GMTjohn.m.ennis@aigora.com (John Ennis)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>.https://github.com/r-universe/aigorahub/actions/runs/39727442646Thu, 22 Oct 2026 03:28:56 GMTturfLP0.3.0successhttps://aigorahub.r-universe.devhttps://github.com/aigorahub/turflpjohn.m.ennis@aigora.com (John Ennis)Reduces compact letter displays (CLDs) of all pairwise comparisons. A CLD gives two groups a common letter exactly when they are not significantly different. The package finds a display with the fewest letter assignments that keeps every one of these relationships. This is the assignment-minimum clique covering problem of Ennis, Fayle, and Ennis (2012) <doi:10.1145/2133803.2275596>, solved as a mixed-integer linear program with 'HiGHS'. Among the displays with the fewest assignments, it returns one fixed canonical display, so the result does not depend on the solver. The package includes the wheat yield example of Piepho (2004) <doi:10.1198/1061860043515>.https://github.com/r-universe/cran/actions/runs/39674178780Wed, 21 Oct 2026 14:50:13 GMTcldreducer0.2.0successhttps://cran.r-universe.devhttps://github.com/cran/cldreducer