Combinatorial Optimization December 22, 2006
Posted by nhabibi in Artificial Intelligence, Computer-Science Term.1 comment so far
Combinatorial optimization is a branch of optimization in applied mathematics and computer science that sits at the intersection of several fields, including artificial intelligence, mathematics and software engineering.
Combinatorial optimization algorithms solve instances of problems that are believed to be hard in general, by exploring the usually-large solution space of these instances(NP-hard problems). Combinatorial optimization algorithms achieve this by reducing the effective size of the space, and by exploring the space efficiently.
Examples of these problems are:
Source: Wikipedia
