A simple heuristic approach to simplex efficiency-Reference-Cited by-同舟云学术

A simple heuristic approach to simplex efficiency

Published:1982-04 Issue:4 Volume:9 Page:344-346
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Ross Sheldon M.

Publisher

Elsevier BV

Subject

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

Reference9 articles.

1. Linear Programming and Extensions;Dantzig,1963

2. Expected number of steps of the simplex method for a linear program with a convexity constraint;Dantzig,1980

3. Some experimental results concerning the expected number of pivots for solving randomly generated linear programs;Dunham,1977

4. Computational experience in solving linear programs;Hoffman;SIAM J. Appl. Math.,1953

5. A class of linear programming problems requiring a large number of iterations;Klee,1968

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

1. Limit Theorems for Record Indicators in Threshold $F^\alpha$-Schemes;Theory of Probability & Its Applications;2020-01

2. Renewal approximation for the absorption time of a decreasing Markov chain;Journal of Applied Probability;2016-09

3. On Asymptotics of Exchangeable Coalescents with Multiple Collisions;Journal of Applied Probability;2008-12

4. On Asymptotics of Exchangeable Coalescents with Multiple Collisions;Journal of Applied Probability;2008-12

5. On the number of jumps of random walks with a barrier;Advances in Applied Probability;2008-03