Author:
Bixby E. Robert,Fenelon Mary,Gu Zonghao,Rothberg Ed,Wunderling Roland
Reference28 articles.
1. E. D. Anderson and K. D. Anderson (1995), Presolving in Linear Programming, Mathematical Programming, 71, No. 2, pp. 221–245.
2. A. Atamturk, G. L. Nemhauser and M. W. P. Savelsbergh (1998), Conflict Graphs in Integer Programming, Report LEC-98–03, Georgia Institute of Technology.
3. E. Balas, S. Ceria, G. Cornueljols and N. Natraj (1996), Gomory Cuts Revisited, Operations Research Letters, 19, pp. 1–10.
4. R. E. Bixby, S. Ceria, C. M. McZeal and M. W. P. Savelsbergh (1998), An Updated Mixed Integer Programming Library: MIPLIB 3.0, Optima, 54, pp. 12–15.
5. A. L. Brearley, G. Mitra and H. P. Williams (1975), Analysis of Mathematical Programming Problems Prior to Applying the Simplex Algorithm, Mathematical Programming, 8, pp. 54–83.
Cited by
82 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献