In theoretical computer science, combinatorial optimization problems are about finding an optimal item from a finite set of objects. Combinatorial optimization is the process of searching for maxima or minima of an unbiased function whose domain is a
algorithmsDescripción completa
Schaum's Combinatorics OutlineFull description
a interesting book on how to solve olympiad combinatorics problems
Combinatorics, Olympiad, Math, Problem-solving
Descripción: TUTORIAL GRASSHOPPER
Algorithms
AlgorithmsFull description
Astronomical Algorithms
Descripción completa
Greedy Algorithms tutorial taken from STCFull description
Genetic algorithms are stochastic optimization methods inspired by natural evolution and genetics. Over the last few decades, genetic algorithms have been successfully applied to many problems of b...
