Pages that link to "Item:Q3950310"

The following pages link to The Average number of pivot steps required by the Simplex-Method is polynomial (Q3950310):

Displaying 40 items.

• The average number of pivot steps of the simplex-algorithm based on a generalized rotation-symmetry-model (Q486944) (← links)
• Exterior point simplex-type algorithms for linear and network optimization problems (Q492840) (← links)
• Recognizing one-dimensional Euclidean preference profiles (Q845009) (← links)
• A hybrid clustering algorithm (Q883287) (← links)
• Efficient GPU-based implementations of simplex type algorithms (Q902763) (← links)
• Experiments with external pivoting (Q909578) (← links)
• Computing \(c\)-optimal experimental designs using the simplex method of linear programming (Q961110) (← links)
• The complex interior-boundary method for linear and nonlinear programming with linear constraints (Q979276) (← 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)
• Parametric linear programming and anti-cycling pivoting rules (Q1108192) (← links)
• Applications of the parametric programming procedure (Q1179007) (← 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)
• On the asymptotic average number of efficient vertices in multiple objective linear programming (Q1273733) (← links)
• An empirical analysis of heuristics for solving the two-machine flow shop problem with job release times (Q1761212) (← links)
• Fast finite methods for a system of linear inequalities (Q1819897) (← links)
• Geometry of the Gass-Saaty parametric cost LP algorithm (Q1825128) (← links)
• The ellipsoid method and its implications (Q1835842) (← links)
• A new efficient primal dual simplex algorithm (Q1868820) (← links)
• Strong polynomiality of the Gass-Saaty shadow-vertex pivoting rule for controlled random walks (Q1945076) (← links)
• Regional complexity analysis of algorithms for nonconvex smooth optimization (Q2020615) (← links)
• Fast quantum subroutines for the simplex method (Q2061891) (← links)
• A note on the complexity of an algorithm for Chebyshev approximation (Q2266346) (← links)
• Iterative computation of security strategies of matrix games with growing action set (Q2292111) (← links)
• Moser's shadow problem (Q2327756) (← links)
• Beyond the worst-case analysis of random priority: smoothed and average-case approximation ratios in mechanism design (Q2672280) (← links)
• An experimental investigation of a primal–dual exterior point simplexalgorithm (Q2868925) (← links)
• On the average number of steps of the simplex method of linear programming (Q3040925) (← links)
• Application of the ellipsoid method in an interactive procedure for multicriteria linear programming (Q3328300) (← links)
• New results on the average behavior of simplex algorithms (Q3337215) (← links)
• Invertibility of random fredholm operators (Q3479323) (← links)
• On the length of simplex paths: The assignment case (Q3698637) (← links)
• On the efficiency of algorithms of analysis (Q3721699) (← 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)
• Polynomial expected behavior of a pivoting algorithm for linear complementarity and linear programming problems (Q4721880) (← links)
• (Q5111230) (← links)
• A Friendly Smoothed Analysis of the Simplex Method (Q5129232) (← links)
• The NP-hard problem of computing the maximal sample variance over interval data is solvable in almost linear time with a high probability (Q6599765) (← links)