Author:
Averkov Gennadiy,Basu Amitabh,Paat Joseph
Publisher
Springer International Publishing
Reference16 articles.
1. Lecture Notes in Computer Science;K Andersen,2007
2. Andersen, K., Wagner, C., Weismantel, R.: On an analysis of the strength of mixed-integer cutting planes from multiple simplex tableau rows. SIAM J. Optim. 20(2), 967–982 (2009)
3. Averkov, G., Krümpelmann, J., Weltge, S.: Notions of maximality for integral lattice-free polyhedra: the case of dimension three (2015).
http://arxiv.org/abs/1509.05200
4. Averkov, G., Wagner, C., Weismantel, R.: Maximal lattice-free polyhedra: finiteness and an explicit description in dimension three. Math. Oper. Res. 36(4), 721–742 (2011)
5. Awate, Y., Cornuéjols, G., Guenin, B., Tuncel, L.: On the relative strength of families of intersection cuts arising from pairs of tableau constraints in mixed integer programs. Math. Program. 150, 459–489 (2014)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献