\begin{definition}[Definition:Combinatorial Optimization]
'''Combinatorial optimization''' is a branch of optimization theory that consists of finding an optimal object from a finite set of objects.
Typical problems are the Travelling Salesman Problem, the Minimum Spanning Tree Problem, and the Knapsack Problem.
\end{definition}