50 LINEAR PROGRAMMING Martin Dyer, Bernd G¨artner, Nimrod Megiddo and Emo Welzl

First Page		Document Content
Date: 2016-07-12 11:32:46 Operations research Linear programming Convex optimization Combinatorial optimization Computational geometry Bounding sphere LP-type problem Simplex algorithm Time complexity Mathematical optimization Integer programming Duality		50 LINEAR PROGRAMMING Martin Dyer, Bernd G¨artner, Nimrod Megiddo and Emo Welzl Add to Reading List Source URL: people.inf.ethz.ch Download Document from Source Website File Size: 211,28 KB Share Document on Facebook

	Leveraging Linear and Mixed Integer Programming for SMT Tim King1 Clark Barrett1 1 New DocID: 1xVFF - View Document
	Exploiting Anonymity in Approximate Linear Programming: Scaling to Large Multiagent MDPs DocID: 1xUZo - View Document
	Mixed-Integer Linear Programming LPBranch-and-Bound Search DocID: 1voVH - View Document
	DECOMPOSITION METHODS FOR INTEGER LINEAR PROGRAMMING by Matthew Galati DocID: 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. Cher DocID: 1vcNT - View Document