Date: 2012-07-04 18:28:36Mathematical optimization Mathematics Operations research Linear programming Convex optimization Combinatorial optimization Computational complexity theory Submodular set function Randomized rounding Optimization problem Matroid Ellipsoid method | | From Convex Optimization to Randomized Mechanisms: Toward Optimal Combinatorial Auctions∗ Shaddin Dughmi† Tim Roughgarden‡Add to Reading ListSource URL: www.qiqiyan.com.s3-website-us-east-1.amazonaws.comDownload Document from Source Website File Size: 255,23 KBShare Document on Facebook
|