Pages that link to "Item:Q2483208"
From MaRDI portal
The following pages link to On the probabilistic complexity of finding an approximate solution for linear programming (Q2483208):
Displaying 8 items.
- Probabilistic complexity analysis for linear problems in bounded domains (Q757053) (← links)
- Probabilistic analysis of an infeasible-interior-point algorithm for linear programming (Q2757589) (← links)
- On the average condition of random linear programs (Q2848174) (← links)
- Approximation Limits of Linear Programs (Beyond Hierarchies) (Q3449458) (← links)
- Toward Probabilistic Analysis of Interior-Point Algorithms for Linear Programming (Q4294728) (← links)
- Logic Programming and Nonmonotonic Reasoning (Q5473961) (← links)
- Stochastic Algorithms for the Estimation of an Optimal Solution of a LP Problem. Convergence and Central Limit Theorem (Q5495072) (← links)
- Characterizations, bounds, and probabilistic analysis of two complexity measures for linear programming problems (Q5930724) (← links)