Combinatorial optimization

Combinatorial optimization is a branch of discrete mathematics. All porblems revolve around finding an optimal object from a set of objects, or finding an ordering of the objects that is optimal according to some criteria. Examples are finding the Minimum spanning tree in a graph or the Travelling Salesman Problem. Many of the problems can also be solved using Linear programming.