/ Best, worst and average case / Binary search algorithm / Cache algorithms / Cluster analysis / combinatorial optimization / Combinatorics & graph theory / Combinatorics and graph theory / computation / Computational Complexity Theory / Computational model / Computational problem / Computational resource / Continuous Optimization / decision problem / Decision Theory / deterministic algorithm / dynamic programming / evolutionary computation / Expander graph / Function approximation / genetic algorithm / Greedy algorithm / Heuristic / Hirsch conjecture / Hybrid algorithm / Implementation / Instance (computer science) / Iteration / Kruskal's algorithm / Linear Complementarity Problem / Linear programming / Linear programming relaxation / Local Optimum / Local search (optimization) / Log-space reduction / Loss Function / Matching (graph theory) / Mathematical optimization / MATHEMATICS / Combinatorics / MATHEMATICS / Optimization / Metropolis–Hastings algorithm / Model of computation / NP-hardness / Optimality criterion / Optimization / Optimization problem / P versus NP problem / Parameter (computer programming) / Partition problem / Polynomial-time approximation scheme / Polynomial-time reduction / Probabilistic method / Processing (programming language) / Quadratic assignment problem / randomized algorithm / Ranking (information retrieval) / Result / Scheduling (computing) / search algorithm / Search problem / Search tree / self-organizing map / Simplex algorithm / Tabu Search / time complexity / Travelling Salesman Problem / Variable (computer science)