<--- Back to Details
First PageDocument Content
Mathematics / Mathematical optimization / Operations research / Geometry / Convex optimization / Lattice points / Computational number theory / Linear programming / Ellipsoid method / Leonid Khachiyan / Lattice reduction / LenstraLenstraLovsz lattice basis reduction algorithm
Date: 2012-07-25 10:24:41
Mathematics
Mathematical optimization
Operations research
Geometry
Convex optimization
Lattice points
Computational number theory
Linear programming
Ellipsoid method
Leonid Khachiyan
Lattice reduction
LenstraLenstraLovsz lattice basis reduction algorithm

51 Documenta Math. Linear Programming Stories

Add to Reading List

Source URL: www.math.uiuc.edu

Download Document from Source Website

File Size: 227,94 KB

Share Document on Facebook

Similar Documents

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

Mathematics / Mathematical optimization / Computational complexity theory / Combinatorial optimization / Travelling salesman problem / Cutting-plane method / Decomposition method / Linear programming / COIN-OR / Ear decomposition

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