First Page | Document Content | |
---|---|---|
Date: 2013-10-17 15:52:26Mathematics Graph theory Economy Operations research Matching Combinatorial optimization NP-complete problems Assignment problem Linear programming Transportation theory Inventory Travelling salesman problem | J EPSILON Pi Mu Epsilon Journal Volume 2—ReprintAdd to Reading ListSource URL: www.pme-math.orgDownload Document from Source WebsiteFile Size: 2,88 MBShare 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 |