Also known as: Combinatorial Optimisation
Combinatorial optimization is the task of finding the best solution from a finite set of possible combinations. It appears in scheduling, routing, allocation, planning, and other problems where many discrete choices must be compared.
In Operations Research, applied mathematics and theoretical computer science, combinatorial optimization is a topic that consists of finding an optimal object from a finite set of objects.