Skip to content

Optimization & Constrained Search

Primes about searching a solution space for the best feasible element under constraints: linear, integer, and multiobjective programming, dynamic programming and branch-and-bound, greedy and heuristic methods, simulated annealing, plus local optima, regularization, and no-free-lunch limits on any single strategy.

18 primes in this family — primes that sit near one another in abstraction space (k-means over structural-signature embeddings). Each is shown with its structural–framed character and how distinctive (sparsely-neighbored) it is.