NP-hard (Non-deterministic Polynomial-time hard), in computational complexity theory, is a class of problems that are, informally, `at least as hard as the hardest problems in NP`. More precisely, a problem H is NP-hard when every problem L in NP can be reduced in polynomial time to H.{rp|80} As a consequence, finding a polynomial algorithm to s.....
Found on
http://en.wikipedia.org/wiki/NP-hard
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
Found on
http://glossary.computing.society.informs.org/index.php?page=N.html
No exact match found.
