First Page | Document Content | |
---|---|---|
Date: 2014-06-27 12:47:14Mathematics Algebra Linear programming Linear algebra Elementary algebra Inequality Linear inequality Expected value Simplex algorithm Boolean satisfiability problem Cutting-plane method Equation solving | Noname manuscript No. (will be inserted by the editor) Cutting to the Chase Solving Linear Integer ArithmeticAdd to Reading ListSource URL: csl.sri.comDownload Document from Source WebsiteFile Size: 428,93 KBShare Document on Facebook |
A Simplex-like Algorithm for Fisher Markets Bharat Adsul1 , Ch. Sobhan Babu2 , Jugal Garg1 , Ruta Mehta1 , and Milind Sohoni1 1 Indian Institute of Technology, BombayDocID: 1vbNG - View Document | |
1 SOLVING LINEAR ORDERING PROBLEMS WITH A COMBINED INTERIOR POINT/SIMPLEX CUTTING PLANE ALGORITHM*DocID: 1uroG - View Document | |
The Ellipsoid Method: A SurveyDocID: 1rsIC - View Document | |
75 Documenta Math. Who Solved the Hirsch Conjecture? ยจ nter M. ZieglerDocID: 1rnGl - View Document | |
PDF DocumentDocID: 1rh3U - View Document |