Author:
Fisher M. L.,Northup W. D.,Shapiro J. F.
Publisher
Springer Berlin Heidelberg
Reference41 articles.
1. S. Agmon, “The relaxation method for linear inequalities”, Canadian Journal of Mathematics 6 (1954) 382–392.
2. D.E. Bell and M.L. Fisher, “Improved integer programming bounds using intersections of corner polyhedra”, Mathematical Programming 8 (1975) 345–368.
3. ORC Rept. 67-20;S.P. Bradley,1967
4. G.B. Dantzig, Linear programming and extensions (Princeton University Press, Princeton, N.J., 1963).
5. R.H. Day, “On optimal extracting from a multiple file data storage system: an application of integer programming”, Operations Research 13 (1965) 482–494.
Cited by
57 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献