Definition:Combinatorial Optimization

From ProofWiki
Jump to navigation Jump to search

Definition

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 traveling salesman problem
the minimum spanning tree problem
the bin packing problem
the knapsack problem.


Also see

  • Results about combinatorial optimization can be found here.


Sources