Mining Rigs for Problems in the Subset Sum Family


[Up] [Top]

Documentation for package ‘FLSSS’ version 9.1.3

Help Pages

addNumStrings Add numeric strings.
arbFLSSS Multidimensional exact subset sum in arbitrary precision and magnitude
arbFLSSSobjRun Run an 'arbFLSSS' instance
auxGAPbb Multithreaded generalized assignment problem solver via branch and bound
auxGAPbbDp Multithreaded generalized assignment problem solver via a hybrid of branch-and-bound and dynamic programming.
auxGAPga Multithreaded generalized assignment problem solver via genetic algorithm
auxKnapsack01bb Multithreaded binary knapsack problem solver via branch and bound
auxKnapsack01dp Multithreaded binary knapsack problem solver via dynamic programming
decomposeArbFLSSS arbFLSSS decomposition
decomposeMflsss mFLSSS decomposition
FLSSS One-dimensional Subset Sum given error threshold
FLSSSmultiset Multi-Subset Sum given error threshold
GAP Generalized Assignment Problem solver
ksumHash Build k-sum accelerator
mFLSSSobjRun Run an 'mFLSSS' instance
mFLSSSpar Multithreaded multidimensional Subset Sum given error thresholds
mFLSSSparImposeBounds Multithreaded multidimensional Subset Sum in bounded solution space given error thresholds
mFLSSSparImposeBoundsIntegerized An advanced version of 'mFLSSSparImposeBounds()'
mFLSSSparIntegerized An advanced version of 'mFLSSSpar()'
mmKnapsack Multithreaded multidimensional Knapsack problem solver
mmKnapsackIntegerized An advanced version of 'mmKnapsack()'