First Page | Document Content | |
---|---|---|
Date: 2008-09-15 12:50:44Linear programming Convex optimization Operations research Computational geometry Randomized algorithm Algorithm Vertex enumeration problem Convex polytope Mathematics Geometry Theoretical computer science | Discrete Comput Geom 6:Geometry Discrete & iAdd to Reading ListSource URL: www.cs.duke.eduDownload Document from Source WebsiteFile Size: 662,50 KBShare Document on Facebook |
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 | |