Author:
Boneh Arnon,Boneh Shahar,Caron Richard J.
Publisher
Springer Science and Business Media LLC
Subject
General Mathematics,Software
Reference8 articles.
1. 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.
2. A. Boneh, “Identification of redundancy by a set covering equivalence,” in: J.P. Brans, ed.,Operational Research '84, Proceedings of the Tenth International Conference on Operational Research (North-Holland, Amsterdam, 1984) pp. 404–422.
3. A. Boneh and A. Golan, “Constraints redundancy and feasible region boundedness by a random feasible point generator (RFPG),” contributed paper,EURO III, Amsterdam, the Netherlands, April 1979.
4. R.J. Caron, J.F. McDonald and C.M. Ponic, “A degenerate extreme point strategy for the classification of linear constraints as redundant or necessary,”Journal of Optimization Theory and Applications 62 (1989) 225–237.
5. V. Chvatal, “A greedy heuristic for the set-covering problem,”Mathematics of Operations Research 4 (1979) 233–235.
Cited by
15 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献