Pages that link to "Item:Q4721880"

The following pages link to Polynomial expected behavior of a pivoting algorithm for linear complementarity and linear programming problems (Q4721880):

Displayed 13 items.

• George Dantzig's impact on the theory of computation (Q951091) ‎ (← links)
• Conjugate gradient method for the linear complementarity problem withs-matrix (Q1007676) ‎ (← links)
• On the complexity of a pivot step of the revised simplex algorithm (Q1068713) ‎ (← links)
• Parametric linear programming and anti-cycling pivoting rules (Q1108192) ‎ (← links)
• Parametric simplex algorithms for a class of NP-complete problems whose average number of steps is polynomial (Q1203065) ‎ (← links)
• Pivot rules for linear programming: A survey on recent theoretical developments (Q1312760) ‎ (← links)
• Globally determining a minimum-area rectangle enclosing the projection of a higher-dimensional set (Q1316098) ‎ (← links)
• Criss-cross methods: A fresh view on pivot algorithms (Q1365063) ‎ (← links)
• Average number of iterations of some polynomial interior-point -- algorithms for linear programming (Q1589768) ‎ (← links)
• On design of a survivable network architecture for dynamic routing: Optimal solution strategy and an efficient heuristic (Q1847145) ‎ (← links)
• Interior-point methods: Worst case and average case analysis of a phase-I algorithm and a termination procedure. (Q1872636) ‎ (← links)
• Improved asymptotic analysis of the average number of steps performed by the self-dual simplex algorithm (Q3755229) ‎ (← links)
• Anstreicher–Terlaky type monotonic simplex algorithms for linear feasibility problems (Q5436927) ‎ (← links)