Pages that link to "Item:Q3989814"
From MaRDI portal
The following pages link to Probabilistic Models for Linear Programming (Q3989814):
Displaying 19 items.
- Smoothed analysis of condition numbers and complexity implications for linear programming (Q623362) (← links)
- Probabilistic analysis of a differential equation for linear programming (Q652446) (← links)
- A universal scaling theory for complexity of analog computation (Q716028) (← links)
- Average case complexity results for a centering algorithm for linear programming problems under Gaussian distributions (Q1002052) (← links)
- Selected bibliography on degeneracy (Q1312748) (← links)
- Degeneracy graphs: Theory and applications. An updated survey (Q1312751) (← links)
- Average number of iterations of some polynomial interior-point -- algorithms for linear programming (Q1589768) (← links)
- Interior-point methods: Worst case and average case analysis of a phase-I algorithm and a termination procedure. (Q1872636) (← links)
- Generation techniques for linear programming instances with controllable properties (Q2220897) (← links)
- Random matrix theory for the analysis of the performance of an analog computer: a scaling theory (Q2383193) (← links)
- Generation of degenerate linear programming problems (Q2483038) (← links)
- On the probabilistic complexity of finding an approximate solution for linear programming (Q2483208) (← links)
- Halting time is predictable for large models: a universality property and average-case analysis (Q2697399) (← links)
- Erratum: Probabilistic models for linear programming (Q2757565) (← links)
- (Q3093394) (← links)
- Scaling and universality of the complexity of analog computation (Q3531580) (← links)
- (Q3770285) (← links)
- An Extended Necessity Measure Maximisation Incorporating the Trade-Off between Robustness and Satisfaction in Fuzzy LP Problems (Q5877218) (← links)
- Generating linear, semidefinite, and second-order cone optimization problems for numerical experiments (Q6641002) (← links)
