First Page | Document Content | |
---|---|---|
![]() Date: 2012-11-28 07:19:03Complexity classes NP-complete problems Mathematical optimization Bin packing problem Operations research Polynomial-time approximation scheme Strongly NP-complete Job shop scheduling Approximation algorithm Theoretical computer science Computational complexity theory Applied mathematics | Add to Reading List |