# NP-hard

### From Glossary

An optimization problem that relies upon the solution of an NP-complete problem. In that sense, NP-hard problems are at least as hard as NP-complete problems.

- Here are some NP-hard problems:
- Bin packing
- Covering, Cutting stock
- Knapsack
- Packing, Partitioning, Pooling
- Traveling Salesman
- Vehicle routing