Combinatorial Optimization Problems
Why
Often the feasible set of an optimization
problem is set with many, say , objects.
Often the size grows exponential in the size
of the representation.
Definition
An optimization problem is
called a combinatorial (a
combinatorial optimization
problem) if is a finite set.
Usually, the language is meant to connote that
the set is large, with respect to some
predetermined notion of size.