CRAN

tbart 1.0

Teitz and Bart's p-Median Algorithm

Released Feb 13, 2015 by Chris Brunsdon

This package can be loaded by Renjin but 5 out 7 tests failed.

Dependencies

Rcpp sp 1.3-1

Solves Teitz and Bart's p-median problem - given a set of points attempts to find subset of size p such that summed distances of any point in the set to the nearest point in p is minimised. Although generally effective, this algorithm does not guarantee that a globally optimal subset is found.

Installation

Maven

This package can be included as a dependency from a Java or Scala project by including the following your project's pom.xml file. Read more about embedding Renjin in JVM-based projects.

<dependencies>
  <dependency>
    <groupId>org.renjin.cran</groupId>
    <artifactId>tbart</artifactId>
    <version>1.0-b268</version>
  </dependency>
</dependencies>
<repositories>
  <repository>
    <id>bedatadriven</id>
    <name>bedatadriven public repo</name>
    <url>https://nexus.bedatadriven.com/content/groups/public/</url>
  </repository>
</repositories>

View build log

Renjin CLI

If you're using Renjin from the command line, you load this library by invoking:

library('org.renjin.cran:tbart')

Test Results

This package was last tested against Renjin 0.9.2689 on Aug 26, 2018.

Source

R
C++

View GitHub Mirror

Release History