Pivot selection methods of the Devex LP code-Reference-Cited by-同舟云学术

Pivot selection methods of the Devex LP code

Published:1975 Issue: Volume: Page:30-57
ISSN:0303-3929
Container-title:Mathematical Programming Studies
language:
Short-container-title:

Author:

Harris Paula M. J.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/BFb0120710.pdf

Reference5 articles.

1. G.B. Dantzig, “Minimization of a linear function of variables subject to linear inequalities”, in: T.C. Koopmans, ed., Activity analysis of production and allocation (Wiley, New York, 1951) pp. 339–347.

2. J.C. Dickson and F.P. Frederick, “A decision rule for improved efficiency in solving linear programming problems with the simplex algorithm”, Communications of the Association for Computing Machinery 3 (1960) 509–512.

3. P.M.J. Harris, “An algorithm for solving mixed integer linear programmes”, Operational Research Quarterly 15 (2) (1964) 117–132.

4. Proceedings of symposia in applied mathematics;H.W. Kuhn,1963

5. P. Wolfe and L. Cutler, “Experiments in linear programming”, in: R. Graves and P. Wolfe, eds., Recent advances in mathematical programming (McGraw-Hill, New York, 1963).

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

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

2. Customizing the solution process of COIN-OR’s linear solvers with Python;Mathematical Programming Computation;2015-10-05

3. The positive edge criterion within COIN-OR׳s CLP;Computers & Operations Research;2014-09

4. Practical guidelines for solving difficult linear programs;Surveys in Operations Research and Management Science;2013-10

5. An affine-scaling pivot algorithm for linear programming;Optimization;2013-04