<--- Back to Details
First PageDocument Content
Mathematics / Algebra / Linear programming / Linear algebra / Elementary algebra / Inequality / Linear inequality / Expected value / Simplex algorithm / Boolean satisfiability problem / Cutting-plane method / Equation solving
Date: 2014-06-27 12:47:14
Mathematics
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 Arithmetic

Add to Reading List

Source URL: csl.sri.com

Download Document from Source Website

File Size: 428,93 KB

Share Document on Facebook

Similar Documents

A Simplex-like Algorithm for Fisher Markets Bharat Adsul1 , Ch. Sobhan Babu2 , Jugal Garg1 , Ruta Mehta1 , and Milind Sohoni1 1 Indian Institute of Technology, Bombay

DocID: 1vbNG - View Document

1 SOLVING LINEAR ORDERING PROBLEMS WITH A COMBINED INTERIOR POINT/SIMPLEX CUTTING PLANE ALGORITHM*

DocID: 1uroG - View Document

Mathematics / Mathematical optimization / Operations research / Computational complexity theory / Linear programming / Convex optimization / Complexity classes / Combinatorial optimization / Ellipsoid method / Leonid Khachiyan / Simplex algorithm / Ellipsoid

The Ellipsoid Method: A Survey

DocID: 1rsIC - View Document

Geometry / Mathematics / Space / Convex geometry / Linear programming / Operations research / Polytopes / Polyhedral combinatorics / Hirsch conjecture / KleeMinty cube / Simplex algorithm / Convex polytope

75 Documenta Math. Who Solved the Hirsch Conjecture? ยจ nter M. Ziegler

DocID: 1rnGl - View Document

Mathematical optimization / Mathematics / Operations research / Linear programming / Convex optimization / Quadratic programming / Interior point method / Duality / Network simplex algorithm / Linear complementarity problem / KarushKuhnTucker conditions / Simplex algorithm

PDF Document

DocID: 1rh3U - View Document