Man pages for adagio
Discrete and Global Optimization Routines
| assignment | Linear Sum Assignment Problem |
| binpacking | Approximate Bin Packing |
| change_making | Change Making Problem |
| cmaes | Covariance Matrix Adaptation Evolution Strategy |
| fminviz | Visualize Function Minimum |
| hamiltonian | Finds a Hamiltonian path or cycle |
| historize | Historize function |
| hookejeeves | Hooke-Jeeves Minimization Method |
| knapsack | 0-1 Knapsack Problem |
| maxempty | Maximally Empty Rectangle Problem |
| maxquad | The MAXQUAD Test Function |
| maxsub | Maximal Sum Subarray |
| mknapsack | Multiple 0-1 Knapsack Problem |
| nelmin | Nelder-Mead Minimization Method |
| occurs | Finding Subsequences |
| setcover | Set cover problem |
| simpleDE | Simple Differential Evolution Algorithm |
| simpleEA | Simple Evolutionary Algorithm |
| subsetsum | Subset Sum Problem |
| testfunctions | Optimization Test Functions |
| transfinite | Boxed Region Transformation |
| trefethen | Trefethen and Wagon Test Functions |
