Pages that link to "Item:Q3040925"
From MaRDI portal
The following pages link to On the average number of steps of the simplex method of linear programming (Q3040925):
Displayed 49 items.
- Probabilistic analysis of a differential equation for linear programming (Q652446) (← links)
- Quantitative simulations by matrices (Q729815) (← links)
- A quadratically convergent method for linear programming (Q808185) (← links)
- Recognizing one-dimensional Euclidean preference profiles (Q845009) (← links)
- Polynomial algorithms for finding the asymptotically optimum plan of the multiindex axial assignment problem (Q852261) (← links)
- Experiments with external pivoting (Q909578) (← links)
- Exponential lower bounds for finding Brouwer fixed points (Q911230) (← links)
- Simplex-inspired algorithms for solving a class of convex programming problems (Q941039) (← links)
- George Dantzig's impact on the theory of computation (Q951091) (← links)
- Conditioning of random conic systems under a general family of input distributions (Q1029212) (← links)
- Average case optimality (Q1071513) (← links)
- Average polynomial time complexity of some NP-complete problems (Q1091815) (← links)
- A new family of exponential LP problems (Q1097169) (← links)
- A simplex variant solving an m\(\times d\) linear program in O(min(m 2,d 2)) expected number of pivot steps (Q1100853) (← links)
- A new simple homotopy algorithm for linear programming. I (Q1102185) (← links)
- Parametric linear programming and anti-cycling pivoting rules (Q1108192) (← links)
- Some remarks on Karmarkar's potential function (Q1109675) (← links)
- Optimal search algorithm for extrema of a discrete periodic bimodal function (Q1121183) (← links)
- Statistical complexity of the power method for Markov chains (Q1122306) (← links)
- Polynomial-time primal simplex algorithms for the minimum cost network flow problem (Q1193519) (← links)
- Parametric simplex algorithms for a class of NP-complete problems whose average number of steps is polynomial (Q1203065) (← links)
- Average number of iterations of some polynomial interior-point -- algorithms for linear programming (Q1589768) (← links)
- Fast finite methods for a system of linear inequalities (Q1819897) (← links)
- Interior-point methods: Worst case and average case analysis of a phase-I algorithm and a termination procedure. (Q1872636) (← links)
- A tree traversal algorithm for decision problems in knot theory and 3-manifold topology (Q1949747) (← links)
- Asymptotic optimality of a transport-problem plan constructed by the minimum-element method (Q1968520) (← links)
- Regional complexity analysis of algorithms for nonconvex smooth optimization (Q2020615) (← links)
- Exact semidefinite formulations for a class of (random and non-random) nonconvex quadratic programs (Q2188238) (← links)
- Estimating the volume of solution space for satisfiability modulo linear real arithmetic (Q2345986) (← links)
- On probabilistic algorithm for solving almost all instances of the set partition problem (Q2399381) (← 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)
- From Parity and Payoff Games to Linear Programming (Q3182965) (← links)
- New results on the average behavior of simplex algorithms (Q3337215) (← links)
- Invertibility of random fredholm operators (Q3479323) (← links)
- Random linear programs with many variables and few constraints (Q3710288) (← links)
- On the efficiency of algorithms of analysis (Q3721699) (← links)
- On Estimating Optimal Bases for Linear Programs (Q3731365) (← links)
- Improved asymptotic analysis of the average number of steps performed by the self-dual simplex algorithm (Q3755229) (← links)
- Polyhedral Combinatorics in Combinatorial Optimization (Q3763906) (← links)
- Recent developments in information-based complexity (Q3780359) (← links)
- On the average speed of Lemke's algorithm for quadratic programming (Q4721868) (← links)
- On the expected number of linear complementarity cones intersected by random and semi-random rays (Q4721878) (← links)
- Polynomial expected behavior of a pivoting algorithm for linear complementarity and linear programming problems (Q4721880) (← links)
- Random inequality constraint systems with few variables (Q4726038) (← links)
- A Friendly Smoothed Analysis of the Simplex Method (Q5129232) (← links)
- (Q5150520) (← links)
- Universality for the Conjugate Gradient and MINRES Algorithms on Sample Covariance Matrices (Q6077897) (← links)
- Monotone meshfree methods for linear elliptic equations in non-divergence form via nonlocal relaxation (Q6134424) (← links)