O M 380.1

Combinatorial Optimization

3 Hours

Concepts of computational complexity; the foundation of discrete mathematics and combinatorial theory.

Prerequisites & course information

Concepts of computational complexity; the foundation of discrete mathematics and combinatorial theory.

Sources