RDocumentation
Moon
Learn R
Search all packages and functions
adagio (version 0.9.2)
Discrete and Global Optimization Routines
Description
The R package 'adagio' will provide methods and algorithms for (discrete) optimization, e.g. knapsack and subset sum procedures, derivative-free Nelder-Mead and Hooke-Jeeves minimization, and some (evolutionary) global optimization functions.
Copy Link
Copy
Link to current version
Version
Version
0.9.2
0.8.5
0.8.4
0.7.1
0.6.5
0.6.3
0.6.1
0.5.9
0.4.3
0.3.5
0.2.8
Down Chevron
Install
install.packages('adagio')
Monthly Downloads
1,129
Version
0.9.2
License
GPL (>= 3)
Maintainer
HwB
Last Published
October 26th, 2023
Functions in adagio (0.9.2)
Search functions
maxquad
The MAXQUAD Test Function
maxsub
Maximal Sum Subarray
neldermead
Nelder-Mead Minimization Method
subsetsum
Subset Sum Problem
simpleEA
Simple Evolutionary Algorithm
transfinite
Boxed Region Transformation
SIAM test functions
Trefethen and Wagon Test Functions
change_making
Change Making Problem
occurs
Finding Subsequences
CMAES
Covariance Matrix Adaptation Evolution Strategy
bpp_approx
Approximate Bin Packing
assignment
Linear Sum Assignment Problem
hookejeeves
Hooke-Jeeves Minimization Method
knapsack
0-1 Knapsack Problem
fminviz,flineviz
Visualize Function Minimum
hamiltonian
Finds a Hamiltonian path or cycle
Historize
Historize function
maxempty
Maximally Empty Rectangle Problem
Testfunctions
Optimization Test Functions
mknapsack
Multiple 0-1 Knapsack Problem
setcover
Set cover problem
simpleDE
Simple Differential Evolution Algorithm