PartLpSolve: Solve a subset sum integer program that models the partition...
In arnaud-m/partition: Race to Solve the Partition Problem
Description
Usage
Arguments
Examples
Description
Symmetry breaking : the sum of integers in S1 is lower than the one in S_2.
WARNING: the timeout does not work. It does not interrupt the lpsolve subprocess.
WARNING: the results are wrong for high precision integers.
Usage
1
PartLpSolve(sizes)
Arguments
sizes
a numeric vector which represents the integers (>0) in the set S.
Examples
1
2
3
sizes <- c(13, 11, 8, 20, 20, 11, 16, 17, 4, 13)
part <- PartLpSolve(sizes)
PartPrint(sizes, part)
arnaud-m/partition documentation built on May 10, 2019, 1:44 p.m.
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
Description Usage Arguments Examples
Description
Symmetry breaking : the sum of integers in S1 is lower than the one in S_2. WARNING: the timeout does not work. It does not interrupt the lpsolve subprocess. WARNING: the results are wrong for high precision integers.
Usage
1 | PartLpSolve(sizes)
|
Arguments
sizes |
a numeric vector which represents the integers (>0) in the set S. |
Examples
1 2 3 | sizes <- c(13, 11, 8, 20, 20, 11, 16, 17, 4, 13)
part <- PartLpSolve(sizes)
PartPrint(sizes, part)
|
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
Embedding an R snippet on your website
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.