I'm a Krener Assistant Professor in the Mathematics Department at UC Davis. I obtained by PhD in the ACO program at Carnegie Mellon University, advised by Gerard Cornuejols.
My research interests lie in theoretical Integer Programming, Polyhedral Theory and Algebraic Combinatorics.
Contact information
Mailing Address: Amitabh Basu
University of California, Davis
Department of Mathematics
1130 Math Sciences Building
One Shields Avenue
Davis, CA-95616
Mathematics Department Office : MSB 3111
Ph: 631-252-3836
Email: abasu[AT]math[DOT]ucdavis[DOT]edu
Resume pdf
Teaching
Current Courses
MAT 16A (Spring 2012)
MAT 17B (Spring 2012)
Past Courses
MAT 17B (Fall 2011)
MAT 16B (Spring 2011)
MAT 16C (Spring 2011)
In the 2010-2011 session, I led an RFG on Applications of Convex Geometry, as part of the NSF funded VIGRE program of the Department of Mathematics. Some lecture notes from the Fall session. The Winter quarter activities are recorded here. The Spring activities will be updated on this page.
Advanced Integer Programming (taught in Spring 2010 at Carnegie Mellon University)
Research Papers
Preprints/Papers Under Review
On Chubanov's method for Linear Programming, submitted (with J. De Loera, M. Junod)
The Triangle Closure is a Polyhedron, submitted (with R. Hildebrand, M. Koeppe)
A (k+1)-Slope Theorem for the k-Dimensional Infinite Group Relaxation, submitted (with R. Hildebrand, M. Koeppe, M. Molinaro)
Algorithmic and Complexity Results for Cutting Planes from Maximal Lattice-Free Convex Sets, submitted (with R. Hildebrand, M. Koeppe)
Journal Articles and Refereed Conference Proceedings
Unique lifting of integer variables in minimal inequalities, (with M. Campelo, M. Conforti, G. Cornuejols, G. Zambelli), to appear in Mathematical Programming A, 2012. A subset of these results appeared in On Lifting Integer Variables in Minimal Inequalities, Proceedings of IPCO 2010, LNCS 6080, 2010, pp. 85--95.
Unique Minimal Liftings for Simplicial Polytopes, to appear in Mathematics of Operations Research (with G. Cornuejols and M. Koeppe), arXiv:1103.4112
Intersection cuts with Infinite Split Rank, (with G. Cornuejols and F. Margot) Mathematics of Operations Research vol. 37 (1), 2012, pp. 21--40.
A Probabilistic Analysis of the Strength of Split and Triangle Closures, (with G. Cornuejols and M. Molinaro) IPCO 2011 version, Proceedings of IPCO 2011, LNCS 6655, 2011, pp. 27--38.
Experiments with two row cuts from degenerate tableaux, (with P. Bonami, G. Cornuejols and F. Margot) INFORMS Journal of Computing vol. 23 (4), 2011, pp. 578--590.
Convex Sets and Minimal Sublinear Functions, (with G. Cornuejols and G. Zambelli) Journal of Convex Analysis, vol. 18(2), 2011, pp. 427--432.
Maximal Lattice-free convex sets in linear subspaces, (with M. Conforti, G. Cornuejols and G. Zambelli) Mathematics of Operations Research vol. 35 (3), 2010, pp. 704--720.
A Counterexample to a Conjecture by Gomory and Johnson, (with M. Conforti, G. Cornuejols and G. Zambelli) November 2008, revised November 2009, to appear in Mathematical Programming A, DOI: 10.1007/s10107-010-0407-1.
Minimal Inequalities for an Infinite Relaxation of Integer Programs, (with M. Conforti, G. Cornuejols and G. Zambelli) SIAM Journal on Discrete Mathematics, vol. 24 (1), 2010, pp. 158--168.
On the Relative Strength of Split, Triangle and Quadrilateral Cuts, (with P. Bonami, G. Cornuejols and F. Margot) Mathematical Programming A,, vol. 126 (2), 2011, pp. 281-314. Preliminary version in Proc. ACM-SIAM SODA, New York, January 2009.
Geometric Algorithms for Optimal Airspace Design and Air Trafiic Controller Workload Balancing, (with J.S.B. Mitchell and G. Sabhnani) ACM Journal on Experimental Algorithmics, vol. 14 (2), 2009, pp. 3--28, Preliminary version in Proc. SIAM ALENEX 2008.
Distributed Localization using Noisy Distance and Angle Information, (with J. Gao, J.S.B. Mitchell and G. Sabhnani) Proc. ACM MobiHoc'06, 262-273, Florence, Italy, May, 2006.
Security types preserving compilation, (with G. Barthe and T. Rezk) Computer Languages, Systems and Structures vol. 33 (2), July 2007, pp. 35--59, Extended Abstract in Proc. VMCAI 2004, 2-15.
Other manuscripts and Expository Notes
Lectures on Modern Approaches to Cutting Planes
Maximal Lattice-free Convex Sets in 3 Dimensions (with Gerard Cornuejols and Francois Margot)
Steiner Point Removal in Graph Metrics (with Anupam Gupta)