See notes on:

  • Mathematical Programming

Polynomial Time Problems

There are some problems that a tractable. It’s bizarre. Many of them are reducible to linear programming.

Dynamic Programming

Sometimes these are cheating in a sense. But if it works it works

Shortest Path

Network Flow


Constraint Satisfaction Problems

Travelling Salesman

Approximation Algorithms