<--- Back to Details
| First Page | Document Content | |
|---|---|---|
 Date: 2012-11-28 07:19:02NP-complete problems NP-complete Set cover problem Vertex cover Approximation algorithm Greedy algorithm P versus NP problem NP Linear programming Theoretical computer science Computational complexity theory Mathematics |
Add to Reading List |
Approximation Algorithms (ADM III) | Leveraging Linear and Mixed Integer Programming for SMT Tim King1 Clark Barrett1 1 NewDocID: 1xVFF - View Document |
| Exploiting Anonymity in Approximate Linear Programming: Scaling to Large Multiagent MDPsDocID: 1xUZo - View Document |
| Mixed-Integer Linear Programming LP Branch-and-Bound SearchDocID: 1voVH - View Document |
| DECOMPOSITION METHODS FOR INTEGER LINEAR PROGRAMMING by Matthew GalatiDocID: 1vkrh - View Document |
| Approximate Linear Programming for Constrained Partially Observable Markov Decision Processes Pascal Poupart† , Aarti Malhotra† , Pei Pei† , Kee-Eung Kim§ , Bongseok Goh§ and Michael Bowling‡ † David R. CherDocID: 1vcNT - View Document |