Category:Definitions/Combinatorial Optimization
Jump to navigation
Jump to search
This category contains definitions related to Combinatorial Optimization.
Related results can be found in Category: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.