An efficient simplex type algorithm for sparse and dense linear programs-Reference-Cited by-同舟云学术

An efficient simplex type algorithm for sparse and dense linear programs

Published:2003-07 Issue:2 Volume:148 Page:323-334
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Paparrizos Konstantinos,Samaras Nikolaos,Stephanides George

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modeling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference28 articles.

1. A comparative computational study with an exterior point simplex algorithm;Alexouda;Proceedings of 4th Balkan Conference on Operational Research,1997

2. A monotonic build-up simplex algorithm for linear programming;Anstreicher;Operation Research,1994

3. Notes on Bland’s pivoting rule;Avis;Mathematical Programming Study,1978

4. Progress in linear programming;Bixby;ORSA journal of computing,1994

5. The simplex method: A probabilistic analysis;Borgwardt,1987

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

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

2. Some experimental results of station cone algorithm in comparison with simplex algorithm for linear programming;Journal of Physics: Conference Series;2020-03-01

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

4. Computational complexity of the exterior point simplex algorithm;Operational Research;2017-01-19

5. Exterior Point Simplex Algorithm;Linear Programming Using MATLAB®;2017