Learn R Programming

⚠️There's a newer version (0.9.2) of this package.Take me there.

adagio (version 0.8.5)

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

Version

Install

install.packages('adagio')

Monthly Downloads

1,614

Version

0.8.5

License

GPL (>= 3)

Maintainer

HwB

Last Published

October 3rd, 2022

Functions in adagio (0.8.5)

hookejeeves

Hooke-Jeeves Minimization Method
knapsack

0-1 Knapsack Problem
Historize

Historize function
maxempty

Maximally Empty Rectangle Problem
CMAES

Covariance Matrix Adaptation Evolution Strategy
bpp_approx

Approximate Bin Packing
fminviz,flineviz

Visualize Function Minimum
assignment

Linear Sum Assignment Problem
hamiltonian

Finds a Hamiltonian path or cycle
simpleEA

Simple Evolutionary Algorithm
simpleDE

Simple Differential Evolution Algorithm
occurs

Finding Subsequences
neldermead

Nelder-Mead Minimization Method
mknapsack

Multiple 0-1 Knapsack Problem
Testfunctions

Optimization Test Functions
maxsub

Maximal Sum Subarray
subsetsum

Subset Sum Problem
SIAM test functions

Trefethen and Wagon Test Functions
setcover

Set cover problem
transfinite

Boxed Region Transformation
maxquad

The MAXQUAD Test Function