Author:
Basu Amitabh,Campelo Manoel,Conforti Michele,Cornuéjols Gérard,Zambelli Giacomo
Publisher
Springer Berlin Heidelberg
Reference15 articles.
1. Lecture Notes in Computer Science;K. Andersen,2007
2. Balas, E.: Intersection Cuts - A New Type of Cutting Planes for Integer Programming. Operations Research 19, 19–39 (1971)
3. Barvinok, A.: A Course in Convexity. In: Graduate Studies in Mathematics, vol. 54. American Mathematical Society, Providence (2002)
4. Basu, A., Conforti, M., Cornuejols, G., Zambelli, G.: A Counterexample to a Conjecture of Gomory and Johnson. Mathematical Programming Ser. A (to appear, 2010)
5. Basu, A., Conforti, M., Cornuejols, G., Zambelli, G.: Maximal Lattice-free Convex Sets in Linear Subspaces (2009) (manuscript)
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献