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

adagio (version 0.7.1)

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.7.1

License

GPL (>= 3)

Maintainer

HwB

Last Published

May 17th, 2018

Functions in adagio (0.7.1)

maxsub

Maximal Sum Subarray

mknapsack

Multiple 0-1 Knapsack Problem

neldermead

Nelder-Mead Minimization Method

assignment

Linear Sum Assignment Problem

fminviz,flineviz

Visualize Function Minimum

maxempty

Maximally Empty Rectangle Problem

simpleDE

Simple Differential Evolution Algorithm

hamiltonian

Finds a Hamiltonian path or cycle

simpleEA

Simple Evolutionary Algorithm

maxquad

The MAXQUAD Test Function

hookejeeves

Hooke-Jeeves Minimization Method

knapsack

0-1 Knapsack Problem

SIAM test functions

Trefethen and Wagon Test Functions

subsetsum

Subset Sum Problem

CMAES

Covariance Matrix Adaptation Evolution Strategy

Testfunctions

Optimization Test Functions

transfinite

Boxed Region Transformation