Pages that link to "Item:Q3110369"

The following pages link to A Fast Algorithm for Linear Programming (Q3110369):

Displaying 15 items.

• Exterior point simplex-type algorithms for linear and network optimization problems (Q492840) (← links)
• Efficient nested pricing in the simplex algorithm (Q943787) (← links)
• Adjacent vertex simplex algorithms: More experimental results on random problems (Q1321806) (← links)
• The simplex algorithm with a new primal and dual pivot rule (Q1342283) (← links)
• A general pricing scheme for the simplex method (Q1417781) (← links)
• Linear programming formulation for non-stationary, finite-horizon Markov decision process models (Q1728357) (← links)
• Book review of: P.-Q. Pan, Linear programming computation (Q1754296) (← links)
• Steepest-edge simplex algorithms for linear programming (Q1802952) (← links)
• A simple direct cosine simplex algorithm (Q2391301) (← links)
• A largest-distance pivot rule for the simplex algorithm (Q2463487) (← links)
• A randomized polynomial-time simplex algorithm for linear programming (Q2931369) (← links)
• (Q3694534) (← links)
• Primal-Dual Path-Following Methods and the Trust-Region Updating Strategy for Linear Programming with Noisy Data (Q5090518) (← links)
• A Deterministic Linear Program Solver in Current Matrix Multiplication Time (Q5146781) (← links)
• A simple polynomial-time rescaling algorithm for solving linear programs (Q5900037) (← links)