Discrete and Global Optimization Routines


[Up] [Top]

Documentation for package ‘adagio’ version 0.8.4

Help Pages

assignment Linear Sum Assignment Problem
bpp_approx Approximate Bin Packing
flineviz Visualize Function Minimum
fminviz Visualize Function Minimum
fnHald Optimization Test Functions
fnNesterov Optimization Test Functions
fnNesterov1 Optimization Test Functions
fnRastrigin Optimization Test Functions
fnRosenbrock Optimization Test Functions
fnShor Optimization Test Functions
fnTrefethen Trefethen and Wagon Test Functions
fnWagon Trefethen and Wagon Test Functions
grHald Optimization Test Functions
grNesterov Optimization Test Functions
grRastrigin Optimization Test Functions
grRosenbrock Optimization Test Functions
grShor Optimization Test Functions
hamiltonian Finds a Hamiltonian path or cycle
hookejeeves Hooke-Jeeves Minimization Method
knapsack 0-1 Knapsack Problem
maxempty Maximally Empty Rectangle Problem
maxquad The MAXQUAD Test Function
maxsub Maximal Sum Subarray
maxsub2d Maximal Sum Subarray
mknapsack Multiple 0-1 Knapsack Problem
neldermead Nelder-Mead Minimization Method
neldermeadb Nelder-Mead Minimization Method
occurs Finding Subsequences
pureCMAES Covariance Matrix Adaptation Evolution Strategy
setcover Set cover problem
simpleDE Simple Differential Evolution Algorithm
simpleEA Simple Evolutionary Algorithm
sss_test Subset Sum Problem
subsetsum Subset Sum Problem
transfinite Boxed Region Transformation