<--- Back to Details
First PageDocument Content
Operations research / Mathematical optimization / Mathematics / Numerical analysis / Linear programming / CPLEX / Algorithm / Simplex algorithm / Simplex / Integer programming / MPS / Travelling salesman problem
Date: 2012-07-25 10:24:47
Operations research
Mathematical optimization
Mathematics
Numerical analysis
Linear programming
CPLEX
Algorithm
Simplex algorithm
Simplex
Integer programming
MPS
Travelling salesman problem

107 Documenta Math. A Brief History of Linear and Mixed-Integer Programming Computation

Add to Reading List

Source URL: www.math.uiuc.edu

Download Document from Source Website

File Size: 177,29 KB

Share Document on Facebook

Similar Documents

Leveraging Linear and Mixed Integer Programming for SMT Tim King1 Clark Barrett1 1 New

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

Exploiting Anonymity in Approximate Linear Programming: Scaling to Large Multiagent MDPs

DocID: 1xUZo - View Document

Mixed-Integer Linear Programming �LP�Branch-and-Bound Search

Mixed-Integer Linear Programming LPBranch-and-Bound Search

DocID: 1voVH - View Document

DECOMPOSITION METHODS FOR INTEGER LINEAR PROGRAMMING by  Matthew Galati

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

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