<?xml version="1.0" encoding="utf-8" ?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:r="https://r-universe.dev"><channel><title>john-aigora.r-universe.dev</title><link>https://john-aigora.r-universe.dev</link><description>Recent package updates in john-aigora</description><generator>R-universe</generator><image><url>https://github.com/john-aigora.png</url><title>R packages by john-aigora</title><link>https://john-aigora.r-universe.dev</link></image><lastBuildDate>Fri, 23 Oct 2026 04:10:40 GMT</lastBuildDate><item><title>[aigorahub] turfLP 0.4.0</title><author>john.m.ennis@aigora.com (John Ennis)</author><description>Finds product portfolios that maximize TURF (total
unduplicated reach and frequency) with integer linear
programming, following Serra (2013)
&lt;doi:10.1016/j.foodqual.2012.10.001&gt;. The maximum reach problem
is the maximal covering location problem of Church and ReVelle
(1974) &lt;doi:10.1007/BF01942293&gt;. 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)
&lt;doi:10.1016/j.foodqual.2011.06.004&gt;.</description><link>https://github.com/r-universe/aigorahub/actions/runs/39963502621</link><pubDate>Fri, 23 Oct 2026 04:10:40 GMT</pubDate><r:package>turfLP</r:package><r:version>0.4.0</r:version><r:status>success</r:status><r:repository>https://aigorahub.r-universe.dev</r:repository><r:upstream>https://github.com/aigorahub/turflp</r:upstream></item><item><title>[aigorahub] cldreducer 0.3.5</title><author>john.m.ennis@aigora.com (John Ennis)</author><description>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 or distinct letters
that keeps every relationship. The optional CLD-sigma objective
is the assignment-minimum clique covering problem of Ennis,
Fayle, and Ennis (2012) &lt;doi:10.1145/2133803.2275596&gt;, solved
as a mixed-integer linear program with 'HiGHS'. The default
CLD-C method selects full maximal cliques with the fewest
letters. Among displays with the selected minimum objective, 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) &lt;doi:10.1198/1061860043515&gt;.</description><link>https://github.com/r-universe/aigorahub/actions/runs/39762503384</link><pubDate>Tue, 20 Oct 2026 13:46:05 GMT</pubDate><r:package>cldreducer</r:package><r:version>0.3.5</r:version><r:status>success</r:status><r:repository>https://aigorahub.r-universe.dev</r:repository><r:upstream>https://github.com/aigorahub/cld-reducer</r:upstream></item></channel></rss>