Discrete and Global Optimization Routines
Linear Sum Assignment Problem
Approximate Bin Packing
Change Making Problem
Covariance Matrix Adaptation Evolution Strategy
Visualize Function Minimum
Finds a Hamiltonian path or cycle
Historize function
Hooke-Jeeves Minimization Method
0-1 Knapsack Problem
Maximally Empty Rectangle Problem
The MAXQUAD Test Function
Maximal Sum Subarray
Multiple 0-1 Knapsack Problem
Nelder-Mead Minimization Method
Finding Subsequences
Set cover problem
Simple Differential Evolution Algorithm
Simple Evolutionary Algorithm
Subset Sum Problem
Optimization Test Functions
Boxed Region Transformation
Trefethen and Wagon Test Functions
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.