Author:
Zabinsky Zelda B.,Smith Robert L.
Publisher
Springer Science and Business Media LLC
Subject
General Mathematics,Software
Reference27 articles.
1. Personal communication from an anonymous referee (February 1990).
2. Working Paper;F. Archetti,1975
3. H.C.P. Berbee, C.G.E. Boender, A.H.G. Rinnooy Kan, C.L. Scheffer, R.L. Smith and J. Telgen, “Hit-and-run algorithms for the identification of nonredundant linear inequalities,”Mathematical Programming 37 (1987) 184–207.
4. A. Boneh, “A probabilistic algorithm for identifying redundancy by a random feasible point generator (RFPG),” in: M.H. Karwan, Bl Lotfi, J. Telgen and S. Zionts, eds.,Redundancy in Mathematical Programming (Springer, Berlin, 1983).
5. S.H. Brooks, “A discussion of random methods for seeking maxima,”Operations Research 6 (1958) 244–251.
Cited by
97 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献