Determining GUB sets via an invert agenda algorithm-Reference-Cited by-同舟云学术

Determining GUB sets via an invert agenda algorithm

Published:1974-12 Issue:1 Volume:7 Page:240-244
ISSN:0025-5610
Container-title:Mathematical Programming
language:en
Short-container-title:Mathematical Programming

Author:

Greenberg Harvey J.,Rarick Dennis C.

Publisher

Springer Science and Business Media LLC

Subject

General Mathematics,Software

Link

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

Reference7 articles.

1. A.L. Brealey, G. Mitra and H.P. Williams, “Analysis of mathematical programming problems prior to applying the simplex algorithm”, Paper presented at the Eighth International Mathematical Programming Symposium, Stanford University, August 1973.

2. E. Hellerman and D. Rarick, “Reinversion with the preassigned pivot procedure”,Mathematical Programming 1 (2) (1971) 195–216.

3. E. Hellerman and D. Rarick, “The partitioned preassigned pivot procedure (P4)”, in:Sparse matrices and their applications, Eds. D.J. Rose and P.A. Willoughby (Plenum Press, New York, 1972) pp. 67–76.

4. D.S. Hirshfeld, “Generalized upper bounding (GUB) theory, applications and performance”, Presentation to Share XXXV, Mathematical Programming Project, August 1970.

5. J.E. Kalan, “Aspects of large-scale in-core linear programming”,Proceedings of ACM (1971) 304–313.

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

1. Detecting embedded pure network structures in LP problems;Top;1998-06

2. Dynamic factorization in large-scale optimization;Mathematical Programming;1994-03

3. The practical conversion of linear programmes to network flow models;European Journal of Operational Research;1991-02

4. Advanced basis construction in linear programming;Annals of Operations Research;1986-06

5. Advanced basis construction in linear programming;Annals of Operations Research;1986-05