Specialized solvers for combinatorial optimization problems in the Subset Sum family. These solvers differ from the mainstream in the options of (i) restricting subset size, (ii) bounding subset elements, (iii) mining realvalue sets with predefined subset sum errors, and (iv) finding one or more subsets in limited time. A novel algorithm for mining the onedimensional Subset Sum induced algorithms for the multiSubset Sum and the multidimensional Subset Sum. The latter decomposes the problem in a novel approach, and the multithreaded framework offers exact algorithms to the multidimensional Knapsack and the Generalized Assignment problems. Package updates include (a) renewed implementation of the multiSubset Sum, multidimensional Knapsack and Generalized Assignment solvers; (b) availability of bounding solution space in the multidimensional Subset Sum; (c) fundamental data structure and architectural changes for enhanced cache locality and better chance of SIMD vectorization; (d) an option of mapping realdomain problems to the integer domain with usercontrolled precision loss, and those integers are further zipped nonuniformly in 64bit buffers. Arithmetic on compressed integers is done by bitmanipulation and the design has virtually zero speed lag relative to normal integers arithmetic. The consequent reduction in dimensionality may yield substantial acceleration. Compilation with g++ 'Ofast' is recommended. See package vignette (<arXiv:1612.04484v3>) for details. Functions prefixed with 'aux' (auxiliary) are or will be implementations of existing foundational or cuttingedge algorithms for solving optimization problems of interest.
Package details 


Author  Charlie Wusuo Liu 
Maintainer  Charlie Wusuo Liu <[email protected]> 
License  GPL3 
Version  8.5.2 
Package repository  View on CRAN 
Installation 
Install the latest version of this package by entering the following in R:

Any scripts or data that you put into this service are public.
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.