Pages that link to "Item:Q1097170"
From MaRDI portal
The following pages link to Probabilistic analysis of optimization algorithms - some aspects from a practical point of view (Q1097170):
Displayed 16 items.
- The combinatorial structure of random polytopes (Q705993) (← links)
- On the oscillation of the expected number of extreme points of a random set (Q756837) (← links)
- Polytopes and arrangements: diameter and curvature (Q935228) (← links)
- Average case complexity results for a centering algorithm for linear programming problems under Gaussian distributions (Q1002052) (← links)
- On the asymptotic average number of efficient vertices in multiple objective linear programming (Q1273733) (← links)
- Optimal distributed execution of join queries (Q1328829) (← links)
- On the complexity of some basic problems in computational convexity. I. Containment problems (Q1344616) (← links)
- Interior-point methods (Q1593831) (← links)
- Pivot versus interior point methods: Pros and cons (Q1598748) (← links)
- An efficient simplex type algorithm for sparse and dense linear programs. (Q1810522) (← links)
- Interior-point methods: Worst case and average case analysis of a phase-I algorithm and a termination procedure. (Q1872636) (← links)
- Cascading-heuristics for the solution of staircase linear programs (Q1891238) (← links)
- On the probabilistic complexity of finding an approximate solution for linear programming (Q2483208) (← links)
- Probability model selection using information-theoretic optimization criterion (Q2746328) (← links)
- The average quality of greedy-algorithms for the Subset-Sum-Maximization Problem (Q3354469) (← links)
- Anstreicher–Terlaky type monotonic simplex algorithms for linear feasibility problems (Q5436927) (← links)