![[R logo]](../../../doc/html/logo.jpg){kind=logo}
![[Up]](../../../doc/html/left.jpg)
![[Top]](../../../doc/html/up.jpg)
| CEGO-package | Combinatorial Efficient Global Optimization in R |
| benchmarkGeneratorFSP | Create Flow shop Scheduling Problem (FSP) Benchmark |
| benchmarkGeneratorNKL | NK-Landscape Benchmark Creation |
| benchmarkGeneratorQAP | Create Quadratic Assignment Problem (QAP) Benchmark |
| benchmarkGeneratorTSP | Create (Asymmetric) Travelling Salesperson Problem (TSP) Benchmark |
| benchmarkGeneratorWT | Create single-machine total Weighted Tardiness (WT) Problem Benchmark |
| CEGO | Combinatorial Efficient Global Optimization in R |
| correctionCNSD | Correcting Conditional Negative Semi-Definiteness |
| correctionDefinite | Correcting Definiteness of a Matrix |
| correctionDistanceMatrix | Correction of a Distance Matrix |
| correctionKernelMatrix | Correction of a Kernel (Correlation) Matrix |
| distanceMatrix | Calculate Distance Matrix |
| distancePermutationAdjacency | Adjacency Distance for Permutations |
| distancePermutationChebyshev | Chebyshev Distance for Permutations |
| distancePermutationCos | Cosine Distance for Permutations |
| distancePermutationEuclidean | Euclidean Distance for Permutations |
| distancePermutationHamming | Hamming Distance for Permutations |
| distancePermutationInsert | Insert Distance for Permutations |
| distancePermutationInterchange | Interchange Distance for Permutations |
| distancePermutationLCStr | Longest Common Substring Distance for Permutations |
| distancePermutationLee | Lee Distance for Permutations |
| distancePermutationLevenshtein | Levenshtein Distance for Permutations |
| distancePermutationLex | Lexicographic permutation distance |
| distancePermutationManhattan | Manhattan Distance for Permutations |
| distancePermutationPosition | Position Distance for Permutations |
| distancePermutationPosition2 | Squared Position Distance for Permutations |
| distancePermutationR | R-Distance for Permutations |
| distancePermutationSwap | Swap-Distance for Permutations |
| distanceVector | Calculate Distance Vector |
| infillExpectedImprovement | Negative Logarithm of Expected Improvement |
| is.CNSD | Check for Conditional Negative Semi-Definiteness |
| is.NSD | Check for Negative Semi-Definiteness |
| is.PSD | Check for Positive Semi-Definiteness |
| landscapeGeneratorGaussian | Create Gaussian Landscape |
| landscapeGeneratorMUL | Multimodal Fitness Landscape |
| landscapeGeneratorUNI | Unimodal Fitness Landscape |
| lexicographicPermutationOrderNumber | Lexicographic order number |
| modelKriging | Kriging Model |
| modelLinear | Distance based Linear Model |
| modelRBFN | RBFN Model |
| mutationBinary | Bit-flip Mutation for Bit-strings |
| mutationBinaryFast | Bit-flip Mutation for Bit-strings (Fast) |
| mutationPermutationInterchange | Interchange Mutation for Permutations |
| mutationPermutationReversal | Reversal Mutation for Permutations |
| mutationPermutationSwap | Swap Mutation for Permutations |
| nearCNSD | Nearest CNSD matrix |
| optim2Opt | Two-Opt |
| optimCEGO | Combinatorial Efficient Global Optimization |
| optimEA | Evolutionary Algorithm for Combinatorial Optimization |
| optimInterface | Optimization Interface (continuous, bounded) |
| optimMaxMinDist | Max-Min-Distance Optimizer |
| optimRS | Combinatorial Random Search |
| predict.modelKriging | Kriging Prediction |
| predict.modelLinear | Predict: Combinatorial Kriging |
| predict.modelRBFN | Predict: Combinatorial RBFN |
| recombinationBinaryUniformCrossoverFast | Uniform Crossover for Bit Strings |
| recombinationPermutationCycleCrossover | Cycle Crossover (CX) for Permutations |
| repairConditionsCorrelationMatrix | Repair Conditions of a Correlation Matrix |
| repairConditionsDistanceMatrix | Repair Conditions of a Distance Matrix |
| solutionFunctionGeneratorBinary | Binary String Generator Function |
| solutionFunctionGeneratorPermutation | Permutation Generator Function |