Login / Signup
On the probabilistic complexity of finding an approximate solution for linear programming.
Jun Ji
Florian A. Potra
Published in:
J. Complex. (2008)
Keyphrases
</>
linear programming
linear program
case study
dynamic programming
probabilistic model
optimal solution
expert systems
np hard
network flow
decision problems
constraint propagation
method finds
neural network
nonlinear programming
quadratic programming
uncertain data
data driven
objective function
website