arnaud-m/partition: Race to Solve the Partition Problem
Collection of functions for a R student project. The goal is to select the best algorithm for solving the partition problem with racing methods. The partition problem consists in finding a bi-partition of a set of integers which minimizes the difference between their sums.
Getting started
Browse package contents
Package details |
|
|---|---|
| Maintainer | |
| License | MIT + file LICENSE |
| Version | 0.0.1.9000 |
| URL | https://github.com/arnaud-m/partition |
| Package repository | View on GitHub |
| Installation |
Install the latest version of this package by entering the following in R:
|
