Definition:Combinatorial Optimization

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

There are no source works cited for this page. Source citations are highly desirable, and mandatory for all definition pages. Definition pages whose content is wholly or partly unsourced are in danger of having such content deleted. To discuss this page in more detail, feel free to use the talk page.