A new efficient primal dual simplex algorithm-Reference-Cited by-同舟云学术

A new efficient primal dual simplex algorithm

Published:2003-08 Issue:9 Volume:30 Page:1383-1399
ISSN:0305-0548
Container-title:Computers & Operations Research
language:en
Short-container-title:Computers & Operations Research

Author:

Paparrizos Konstantinos,Samaras Nikolaos,Stephanides George

Publisher

Elsevier BV

Subject

Management Science and Operations Research,Modeling and Simulation,General Computer Science

Reference21 articles.

1. Some distribution-independent results about the asymptotic order of the average number of pivot steps of the simplex algorithm;Borgwardt;Mathematics of Operations Research,1982

2. The average number of pivot steps required by the simplex method is polynomial;Borgwardt;Zeitschrift fur Operational Research, Series A: Theory,1982

3. Klee V, Minty GJ. How good is the simplex algorithm? In: Shisha O, editor. Inequalities III. New York: Academic Press; 158–72.

4. Multiple centrality corrections in a primal-dual method for linear programming;Gondzio;Computational Optimization and Applications,1996

5. Splitting dense columns of constraint matrix in interior point methods for large-scale linear programming;Gondzio;Optimization,1992

Cited by 26 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Solving an Integer Program by Using the Nonfeasible Basis Method Combined with the Cutting Plane Method;Advances in Intelligent Systems and Computing;2021

2. A new non-monotonic infeasible simplex-type algorithm for Linear Programming;PeerJ Computer Science;2020-03-30

3. Improving a primal–dual simplex-type algorithm using interior point methods;Optimization;2018-09-25

4. Revised simplex algorithm for linear programming on GPUs with CUDA;Multimedia Tools and Applications;2018-04-18

5. Sparsity Prevention Pivoting Method for Linear Programming;IEEE Access;2018