Category:Combinatorial Optimization

From ProofWiki
Jump to navigation Jump to search

This category contains results about Combinatorial Optimization.
Definitions specific to this category can be found in Definitions/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.

This category currently contains no pages or media.