First Page | Document Content | |
---|---|---|
Date: 2015-06-23 14:22:34Applied mathematics George Dantzig Linear programming Mathematical economics John von Neumann Cutting-plane method Simplex algorithm Nonlinear programming Travelling salesman problem Mathematics Mathematical optimization Operations research | Add to Reading ListSource URL: www2.informs.orgDownload Document from Source WebsiteFile Size: 73,79 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 | |
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 |