Lagrangian Relaxation for Large-Scale Multi-Agent Planning Geoffrey J. Gordon† , Pradeep Varakantham‡ , William Yeoh∗ , Hoong Chuin Lau‡ , Ajay S. Aravamudhan‡ and Shih-Fen Cheng‡ † Machine Learning Departm

First Page		Document Content
Date: 2013-03-07 09:00:10 Convex optimization Lagrangian relaxation Lagrange multiplier Relaxation Linear programming Mathematical optimization Mathematical analysis Duality		Lagrangian Relaxation for Large-Scale Multi-Agent Planning Geoffrey J. Gordon† , Pradeep Varakantham‡ , William Yeoh∗ , Hoong Chuin Lau‡ , Ajay S. Aravamudhan‡ and Shih-Fen Cheng‡ † Machine Learning Departm Add to Reading List Source URL: www.cs.cmu.edu Download Document from Source Website File Size: 275,57 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