Faculty

Amitabh Basu

Associate Professor

Research Interests

  • Optimization
  • Discrete and Combinatorial Geometry
  • Operations Research
  • Convex Analysis

Amitabh Basu is an associate professor in the Department of Applied Mathematics and Statistics, with a secondary appointment in Computer Science. His research focuses on optimization, discrete and combinatorial geometry, operations research, and convex analysis. He earned his doctorate at Carnegie Mellon University in 2010; his master’s at Stony Brook University in 2006; and his B.Tech at the Indian Institute of Technology in 2004. He came to Johns Hopkins in 2013 from the University of California Davis.

Education
  • Ph.D. 2010, CARNEGIE MELLON UNIVERSITY
  • Master of Science 2006, Stony Brook University Suny
  • Bachelor of Science 2004, Indian Institute Of Technology
Experience
  • 2010 - 2013:  Krener Assistant Professor, University of California, Davis
  • 2009 - 2010:  Research assistant, Carnegie Mellon University
  • 2006 - 2010:  Teaching Assistant, Carnegie Mellon University
  • 2005 - 2005:  Summer Intern, AT & T Research Shannon Labs
  • 2003 - 2003:  Summer Intern, INRIA Research Labs
Research Areas
  • CONVEX geometry
  • CONVEX programming
  • DISCRETE geometry
  • GEOMETRY of numbers
  • INTEGER programming
  • MACHINE learning
  • MIXED integer linear programming
  • Mathematical optimization -- Mathematical models
  • STATISTICAL decision making
  • Statistical Machine Learning
Awards
  • 2019:  CRM-Simons Scholar in Residence
  • 2018:  US Junior Oberwolfach fellow
  • 2017:  Joel Dean Excellence in Teaching Award
  • 2016:  Joel Dean Excellence in Teaching Award
  • 2015:  National Science Foundation CAREER award (NSF CAREER)
  • 2013:  G. Thomas Sallee Mathematics Teaching award
  • 2012:  A. W. Tucker Prize, finalist
  • 2011:  American Mathematical Society(AMS)-Simons Travel Grant
  • 2010:  Gerald L. Thomson doctoral dissertation award
  • 2006:  William Larimer Mellon Fellowship
  • 2000:  Gold medal at the Indian National Physics Olympiad
  • 1998:  National Talent Search awardee
Journal Articles
  • Basu A, Hayden Helm, Avanti Athreya, Youngser Park, Joshua T. Vogelstein, Carey E. Priebe, Michael Winding, Marta Zlatic, Albert Cardona, Patrick Bourke, Weiwei Yang, Jonathan Larson, Chris White (2020).  Distance-based Positive and Unlabeled Learning for Ranking.  Journal of Machine Learning Research (JMLR).
  • Basu A, Michele Conforti, Marco Di Summa, Hongyi Jiang (2020).  Split cuts in the plane.  SIAM Journal on Optimization.
  • Basu A, Dongwei Fan, Tamas Budavari, Ray P. Norris (2020).  Optimal probabilistic catalogue matching for radio sources.  Monthly Notices of the Royal Astronomical Society.  498(1).  565–573.
  • Basu A, Tu Nguyen, Ao Sun (2020).  Admissibility of solution estimators in stochastic optimization.  SIAM Journal on Mathematics of Data Science.
  • Basu A, Hongyi Jiang (2020).  Two-halfspace closure.  Mathematical Programming.
  • Basu A, Michele Conforti, Marco Di Summa, Hongyi Jiang (2020).  Complexity of cutting planes and branch-and-bound in mixed-integer optimization.  Mathematical Programming.
  • Basu A, Conforti M, Di Summa M (2020).  An extreme function which is nonnegative and discontinuous everywhere.  Mathematical Programming.  179(1-2).  447-453.
  • Fan Tian, Tamas Budavari, Basu A, Stephen H. Lubow, Richard L. White (2019).  Robust registration of astronomy catalogs with applications to the Hubble Space Telescope.  The Astronomical Journal.  158(5).
  • Basu A, Ryan CT, Sankaranarayanan S (2019).  Mixed-integer bilevel representability.  Mathematical Programming.
  • Basu A, Dey SS, Paat J (2019).  Nonunique lifting of integer variables in minimal inequalities.  SIAM Journal on Discrete Mathematics.  33(2).  755-783.
  • Basu A, Sankaranarayanan S (2019).  Can cut-generating functions be good and efficient?.  SIAM Journal on Optimization.  29(2).  1190-1210.
  • Basu A, Martin K, Ryan CT, Wang G (2019).  Mixed-integer linear representability, disjunctions, and chvátal functions—modeling implications.  Mathematics of Operations Research.  44(4).  1264-1285.
  • Basu A, Conforti M, Summa MD, Paat J (2019).  The structure of the infinite models in integer programming.  Mathematics of Operations Research.  44(4).  1412-1430.
  • Shi X, Budavári T, Basu A (2019).  Probabilistic Cross-identification of Multiple Catalogs in Crowded Fields.  Astrophysical Journal.  870(1).
  • Basu A, Conforti M, Summa MD, Zambelli G (2019).  Optimal cutting planes from the group relaxations.  Mathematics of Operations Research.  44(4).  1208-1220.
  • Basu A, Hildebrand R, Molinaro M (2018).  Minimal cut-generating functions are nearly extreme.  Mathematical Programming.  172(1-2).  329-349.
  • Basu A, Conforti M, Di Summa M, Paat J (2018).  Extreme functions with an arbitrary number of slopes.  Mathematical Programming.  172(1-2).  303-327.
  • Rangamani A, Mukherjee A, Basu A, Arora A, Ganapathi T, Chin S, Tran TD (2018).  Sparse Coding and Autoencoders.  IEEE International Symposium on Information Theory - Proceedings.  2018-June.  36-40.
  • Averkov G, Basu A, Paat J (2018).  Approximation of corner polyhedra with families of intersection cuts.  SIAM Journal on Optimization.  28(1).  904-929.
  • Lebair TM, Basu A (2018).  Approximation of minimal functions by extreme functions.  SIAM Journal on Optimization.  28(3).  2518-2540.
  • Arora R, Basu A, Mianjy P, Mukherjee A (2018).  Understanding deep neural networks with rectified linear units.  6th International Conference on Learning Representations, ICLR 2018 - Conference Track Proceedings.
  • Arora R, Basu A, Mianjy P, Mukherjee A (2018).  Understanding deep neural networks with rectified linear units.  6th International Conference on Learning Representations, ICLR 2018 - Conference Track Proceedings.
  • Basu A, Conforti M, Cornuéjols G, Weismantel R, Weltge S (2017).  Optimality certificates for convex minimization and Helly numbers.  Operations Research Letters.  45(6).  671-674.
  • Basu A, Hildebrand R, Köppe M (2017).  Equivariant perturbation in Gomory and Johnson’s infinite group problem—III: foundations for the k-dimensional case with applications to k= 2.  Mathematical Programming.  163(1-2).  301-358.
  • Basu A, Martin K, Ryan CT (2017).  Strong duality and sensitivity analysis in semi-infinite linear programming.  Mathematical Programming.  161(1-2).  451-485.
  • Basu A, Oertel T (2017).  Centerpoints: A link between optimization and convex geometry.  SIAM Journal on Optimization.  27(2).  866-889.
  • Basu A, Conforti M, Di Summa M, Paat J (2017).  The structure of the infinite models in integer programming.  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).  10328 LNCS.  63-74.
  • Basu A, Martin K, Ryan CT, Wang G (2017).  Mixed-integer linear representability, disjunctions, and variable elimination.  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).  10328 LNCS.  75-85.
  • Averkov G, Basu A, Paat J (2017).  Approximation of corner polyhedra with families of intersection cuts.  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).  10328 LNCS.  51-62.
  • Basu A, Santanu S. Dey, Joseph Paat (2017).  Non-unique lifting of integer variables in minimal inequalities.  SIAM Journal on Discrete Mathematics.
  • Lee BCG, Budavári T, Basu A, Rahman M (2016).  GALAXY REDSHIFTS from DISCRETE OPTIMIZATION of CORRELATION FUNCTIONS.  Astronomical Journal.  152(6).
  • Budavári T, Basu A (2016).  PROBABILISTIC CROSS-IDENTIFICATION in CROWDED FIELDS AS AN ASSIGNMENT PROBLEM.  Astronomical Journal.  152(4).
  • Basu A, Dinitz M, Li X (2016).  Computing approximate PSD factorizations.  Leibniz International Proceedings in Informatics, LIPIcs.  60.
  • Basu A, Hildebrand R, Köppe M (2016).  Light on the infinite group relaxation I: foundations and taxonomy.  4OR.  14(1).  1-40.
  • Basu A, Hildebrand R, Molinaro M (2016).  Minimal cut-generating functions are nearly extreme.  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).  9682.  202-213.
  • Basu A, Conforti M, Di Summa M, Paat J (2016).  Extreme functions with an arbitrary number of slopes.  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).  9682.  190-201.
  • Basu A, Oertel T (2016).  Centerpoints: A link between optimization and convex geometry.  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).  9682.  14-25.
  • Basu A, Hildebrand R, Köppe M (2016).  Light on the infinite group relaxation II: sufficient conditions for extremality, sequences, and algorithms.  4OR.  14(2).  107-131.
  • Averkov G, Basu A (2015).  Lifting properties of maximal lattice-free polyhedra.  Mathematical Programming.  154(1-2).  81-111.
  • Basu A, Conforti M, Di Summa M (2015).  A geometric approach to cut-generating functions.  Mathematical Programming.  151(1).  153-189.
  • Basu A, Martin K, Ryan CT (2015).  Projection: A unified approach to semi-infinite linear programs and duality in convex programming.  Mathematics of Operations Research.  40(1).  146-170.
  • Basu A, Hildebrand R, Köppe M (2015).  Equivariant perturbation in Gomory and Johnson's infinite group problem. I. The one-dimensional case.  Mathematics of Operations Research.  40(1).  105-129.
  • Basu A, Molinaro M (2015).  Characterization of the split closure via geometric lifting.  European Journal of Operational Research.  243(3).  745-751.
  • Basu A, Paat J (2015).  Operations that preserve the covering property of the lifting region.  SIAM Journal on Optimization.  25(4).  2313-2333.
  • Basu A, Hildebrand R, Köppe M (2014).  The triangle closure is a polyhedron.  Mathematical Programming.  145(1-2).  19-58.
  • Basu A, Martin K, Ryan CT (2014).  On the sufficiency of finite support duals in semi-infinite linear programming.  Operations Research Letters.  42(1).  16-20.
  • Basu A, De Loera JA, Junod M (2014).  On Chubanov's method for linear programming.  INFORMS Journal on Computing.  26(2).  336-350.
  • Averkov G, Basu A (2014).  On the unique-lifting property.  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).  8494 LNCS.  76-87.
  • Basu A, Campêlo M, Conforti M, Cornuéjols G, Zambelli G (2013).  Unique lifting of integer variables in minimal inequalities.  Mathematical Programming.  141(1-2).  561-576.
  • Basu A, Hildebrand R, Köppe M, Molinaro M (2013).  A (k + 1)-slope theorem for the k-dimensional infinite group relaxation.  SIAM Journal on Optimization.  23(2).  1021-1040.
  • Basu A, Hildebrand R, Köppe M (2013).  Equivariant perturbation in Gomory and Johnson's infinite group problem: II. The unimodular two-dimensional case.  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).  7801 LNCS.  62-73.
  • Basu A, Conforti M, Cornuéjols G, Zambelli G (2012).  A counterexample to a conjecture of Gomory and Johnson.  Mathematical Programming.  133(1-2).  25-38.
  • Basu A, Cornuéjols G, Köppe M (2012).  Unique minimal liftings for simplicial polytopes.  Mathematics of Operations Research.  37(2).  346-355.
  • Basu A, Cornuéjols G, Margot F (2012).  Intersection cuts with infinite split rank.  Mathematics of Operations Research.  37(1).  21-40.
  • Basu A, Cornuéjols G, Molinaro M (2011).  A probabilistic analysis of the strength of the split and triangle closures.  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).  6655 LNCS.  27-38.
  • Basu A, Cornuéjols G, Zambelli G (2011).  Convex sets and minimal sublinear functions.  Journal of Convex Analysis.  18(2).  427-432.
  • Basu A, Bonami P, Cornuéjols G, Margot F (2011).  On the relative strength of split, triangle and quadrilateral cuts.  Mathematical Programming.  126(2).  281-314.
  • Basu A, Bonami P, Cornuéjols G, Margot F (2011).  Experiments with two-row cuts from degenerate tableaux.  INFORMS Journal on Computing.  23(4).  578-590.
  • Basu A, Conforti M, Cornuéjols G, Zambelli G (2010).  Maximal lattice-free convex sets in linear subspaces.  Mathematics of Operations Research.  35(3).  704-720.
  • Basu A, Campelo M, Conforti M, Cornuéjols G, Zambelli G (2010).  On lifting integer variables in minimal inequalities.  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).  6080 LNCS.  85-95.
  • Basu A, Conforti M, Cornuéjols G, Zambelli G (2010).  Minimal inequalities for an infinite relaxation of integer programs.  SIAM Journal on Discrete Mathematics.  24(1).  158-168.
  • Basu A, Bonami P, Cornuéjols G, Margot F (2009).  On the relative strength of split, triangle and quadrilateral cuts.  Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms.  1220-1229.
  • Basu A, Mitchell JS, Sabhnani GK (2009).  Geometric algorithms for optimal airspace design and air traffic controller workload balancing.  ACM Journal of Experimental Algorithmics (JEA).  14(2).  3--28.
Conference Proceedings
  • Akshay Rangamani, Anirbit Mukherjee, Basu A, Tejaswini Ganapathy, Ashish Arora, Sang Chin, Trac D. Tran (2018).  Sparse coding and autoencoders.  IEEE International Symposium on Information Theory.
  • Basu A, Arora R, Mianjy P, Mukherjee A (2018).  Understanding Deep Neural Networks with Rectified Linear Units.  International Conference on Learning Representations (ICLR) 2018.
  • Basu A, Conforti M, Di Summa M, Paat J (2017).  The structure of the infinite models in integer programming.  Integer Programming and Combinatorial Optimization (IPCO) 2017.  Proceedings of IPCO 2017, Lecture Notes in Computer Science.  51 -- 62.
  • Basu A, Averkov G, Paat J (2017).  Approximation of corner polyhedra with families of intersection cuts.  Integer Programming and Combinatorial Optimization (IPCO) 2017.  Proceedings of IPCO 2017, Lecture Notes in Computer Science.  63 -- 74.
  • Basu A, Ryan CT, Martin RK, Wang G (2017).  Mixed-integer linear representability, disjunctions, and variable elimination.  Integer Programming and Combinatorial Optimization (IPCO) 2017.  Proceedings of IPCO 2017, Lecture Notes in Computer Science.  75 -- 85.
  • Basu A, Dinitz M, Li X (2016).  Computing approximate PSD factorizations.  APPROX-RANDOM 2016.  Proceedings of APPROX-RANDOM, Leibniz International Proceedings in Informatics.  article id 2.
  • Basu A, Oertel T (2016).  Centerpoints: A link between optimization and convex geometry.  Integer Programming and Combinatorial Optimization (IPCO) 2016.  Proceedings of IPCO 2016, Lecture Notes in Computer Science.  14--25.
  • Basu A, Conforti M, Di Summa M, Paat J (2016).  Extreme functions with an arbitrary number of slopes.  Integer Programming and Combinatorial Optimization (IPCO) 2016.  Proceedings of IPCO 2016, Lecture Notes in Computer Science.  190--201.
  • Basu A, Hildebrand R, Molinaro MS (2016).  Minimal cut-generating functions are nearly extreme.  Integer Programming and Combinatorial Optimization (IPCO) 2016.  Proceedings of IPCO 2016, Lecture Notes in Computer Science.  pp. 202--213.
  • Averkov G, Basu A (2014).  On the Unique-Lifting Property.  Integer Programming and Combinatorial Optimization (IPCO) 2014.  Proceedings of IPCO 2014, Lecture Notes in Computer Science.  76-87.
  • Basu A, Hildebrand R, Köppe M (2013).  Equivariant Perturbation in Gomory and Johnson's Infinite Group Problem: II. The Unimodular Two-Dimensional Case.  Integer Programming and Combinatorial Optimization (IPCO) 2013.  Proceedings of IPCO 2013, Lecture Notes in Computer Science.  62-73.
  • Basu A, Cornuéjols G, Molinaro M (2011).  A probabilistic analysis of the strength of the split and triangle closures.  Integer Programming and Combinatorial Optimization (IPCO) 2011.  Proceedings of IPCO 2011, Lecture Notes in Computer Science.  27--38.
  • Basu A, Campelo M, Conforti M, Cornuéjols G, Zambelli G (2010).  On lifting integer variables in minimal inequalities.  Integer Programming and Combinatorial Optimization (IPCO) 2010.  Proceedings of IPCO 2010, Lecture Notes in Computer Science.  85-95.
  • Basu A, Gao J, Mitchell JS, Sabhnani G (2006).  Distributed localization using noisy distance and angle information.  Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing.  262-273.
  • Barthe G, Basu A, Rezk T (2004).  Security types preserving compilation.  Verification, Model Checking, and Abstract Interpretation.  Proccedings of VMCAI 2004, Lecture Notes in Computer Science.  2-15.
  • "Concrete complexity bounds for optimizing over integers", Combinatorics, Game theory and Optimisation (CGO) seminar.  London, United Kingdom of Great Britain and Northern Ireland (the).  October 29, 2020
  • "Provable complexity bounds for integer programming algorithms", Discrete Optimization Talks (DOTs).  United States of America (the).  July 7, 2020
  • "Complexity of branch-and-bound and cutting plane algorithms", Mixed Integer Programming (MIP) workshop.  United States of America (the).  May 15, 2020
  • "The cut generating function approach in integer programming", International Symposium on Combinatorial Optimization.  Montreal, Canada.  May 4, 2020
  • "Duality and algorithms for convex (nonlinear) mixed-integer optimization", Industrial Optimization seminar.  Toronto, Canada.  October 22, 2019
  • "Complexity of Branch-and-bound and Cutting Plane Algorithms", CRM/DIMACS Workshop on Mixed-Integer Nonlinear Programming.  Montreal, Canada.  October 10, 2019
  • "Representability of optimization models", 19th French-German-Swiss conference on optimization.  Nice, France.  September 17, 2019
  • "Admissibility in stochastic optimization and deep learning", SAMSI semester in Deep Learning.  Durham North Carolina, United States of America (the).  August 12, 2019
  • "Statistical decision theory perspectives on learning and stochastic optimization", 2nd conference on Discrete Optimization and Machine Learning.  Tokyo, Japan.  July 29, 2019
  • "Admissibility of solution estimators in stochastic optimization", Bay Area Optimization Day (BayOpt) 2019.  Santa Cruz California, United States of America (the).  May 17, 2019
  • "Sublinearity in Integer Optimization", Scientific Computing seminar.  Vancouver British Columbia, Canada.  March 19, 2019
  • "Admissibility of solution estimators in stochastic optimization", 23rd Combinatorial Optimization workshop at Aussois.  Aussois, France.  January 11, 2019
  • "Representability of optimization models", Oberwolfach workshop on Combinatorial Optimization.  Oberwolfach, Germany, Germany.  November 15, 2018
  • "Provable bounds on expressibility and training of neural networks", Theoretical foundations of deep learning.  Atlanta Georgia, United States of America (the).  October 8, 2018
  • "Optimality of Gomory Cuts", International Symposium on Mathematical Programming (ISMP) 2018.  Bordeaux, France.  July 1, 2018
  • "Optimality of Gomory Cuts", Optimization seminar, ETH Zurich.  Zurich, Switzerland.  May 24, 2018
  • "Discrete Geometry meets Machine Learning", Optimization and Discrete Geometry : Theory and Practice.  Tel Aviv, Israel NY.  April 24, 2018
  • "Discrete Optimization Techniques for Neural Networks", Colloquium of the Dept. of Computational and Applied Mathematics (CAAM), Rice University.  Houston Texas, United States of America (the).  March 20, 2018
  • "Centerpoints: A Link Between Optimization and Convex Geometry", Colloquium of the Dept. of Operations Research and Information Engineering, Cornell University.  Ithaca New York, United States of America (the).  January 25, 2018
  • "Discrete Geometry meets Machine Learning", 22nd Aussois Combinatorial Optimization workshop 2018.  France.  January 10, 2018
  • "Optimality of Gomory Cuts", INFORMS Annual Meeting, 2017.  Houston, USA.  November 16, 2017
  • "Centerpoints: A Link Between Optimization and Convex Geometry", Computer Science department seminar, Johns Hopkins University.  Baltimore MD.  October 19, 2017
  • "Understanding Deep Neural Networks with Rectified Linear Units", SIAM Conference on Applied Algebraic Geometry.  Atlanta, GA.  July 31, 2017
  • "Understanding Deep Neural Networks with Rectified Linear Units", IBM T.J. Watson Mathematical Sciences seminar.  Yorktown Heights, NY.  March 20, 2017
  • "Understanding Deep Neural Networks with Rectified Linear Units", Discrete Optimization seminar, Georgia Institute of Technology.  Atlanta Georgia, United States of America (the).  February 24, 2017
  • "Centerpoints: A link between optimization and convex geometry", INFORMS Annual Meeting 2016.  Nashville, Tennessee.  November 1, 2016
  • "Cut Generating Functions: where Convex Geometry, Functional Analysis and Geometry of Numbers meet", 7th Cargese Combinatorial Optimization Workshop (2016).  Cargese, Corsica, France.  October 11, 2016
  • "Centerpoints: A link between optimization and convex geometry", MOPTA: Modeling, OPtimization: Theory and Applications.  Bethlehem, Pennsylvania.  August 17, 2016
  • "Centerpoints: A link between optimization and convex geometry", Workshop of Advances in Optimization.  Tokyo, Japan.  August 12, 2016
  • "Strong duality and sensitivity analysis in semi-infinite linear programming", International Conference on Continuous Optimization (ICCOPT).  Tokyo, Japan.  August 6, 2016
  • "Minimal cut-generating functions are nearly extreme", Integer Programming and Combinatorial Optimization (IPCO) 2016.  University of Liege, Belgium.  June 2, 2016
  • "Matching Catalogs, Not Sources: Crowded Fields and the Hungarian Algorithm", A Cosmic Census of the Galaxies in the Distant Universe.  Leiden, NL.  June 1, 2016
  • "The lifting problem for cut-generating functions", CORE@50: A conference in celebration of 50 years of CORE (Center for Operations Research and Econometrics).  Louvain-la-Neuve, Belgium.  May 23, 2016
  • "Projection: A Unified Approach to Semi-Infinite Linear Programs with applications to Convex Optimization", Colloquium seminar for Department of Mathematical Sciences, George Mason University.  Fairfax Virginia, United States of America (the).  April 22, 2016
  • "Photometric Redshifts and Beyond", LSST Photo-Z Workshop.  Pittsburgh, PA.  April 1, 2016
  • "New Perspectives in Mixed-Integer Optimization", Industrial Engineering and Operations Research seminar, Columbia University.  New York.  February 9, 2016
  • "Introduction to Cut-Generating Functions", Modern Techniques in Discrete Optimization: Mathematics, Algorithms and Applications.  Oaxaca, Mexico.  November 3, 2015
  • "Projection: A Unified Approach to Semi-Infinite Linear Programs with applications to Convex Optimization", Center for Scienti c Computing and Mathematical Modeling (CSCAMM) seminar, U. Maryland-College Park.  College Park Maryland, United States of America (the).  October 7, 2015
  • "Projection: A Unified Approach to Semi-Infinite Linear Programs with applications to Convex Optimization", Statistical Sciences and Operations Research seminar, Virginia Commonwealth University.  Richmond, Virginia.  September 30, 2015
  • "Techniques for the Infinite Group Problem", International Symposium on Mathematical Programming (ISMP) 2015.  Pittsburgh.  July 12, 2015
  • "A survey of cut-generating functions", Polyhedral Combinatorics (PoCo) 2015.  Carnegie Mellon University, Pittsburgh.  July 8, 2015
  • "Approximate PSD factorizations", Mixed-Integer Programming (MIP) 2015.  Chicago, USA.  June 3, 2015
  • "On the Covering Property of the Lifting Region", Systems, Information, Learning and Optimization (SILO) seminar, U. Wisconsin-Madison.  Madison, Wisconsin.  April 8, 2015
  • "Techniques for the Infinite Group Problem", AMS Spring sectional meeting.  George Washington U., Washington DC.  March 7, 2015
  • "Techniques for the Infinite Group Problem", 19th Aussois workshop on combinatorial optimization.  Aussois, France.  January 4, 2015
  • "A unified approach to semi-infinite linear programming with applications to convex optimization", Foundations of Computational Mathematics (FoCM).  Montevideo, Uruguay.  December 15, 2014
  • "Cutting Planes and Geometry of Numbers", Computer Science Theory seminar, Johns Hopkins University.  Baltimore MD.  November 20, 2014
  • "On the Covering Property of the Lifting Region", Oberwolfach workshop on Combinatorial Optimization.  Oberwolfach, Germany.  November 9, 2014
  • "On the Covering Property of the Lifting Region", Operations Research seminar, Carnegie Mellon University.  Pittsburgh, PA.  October 24, 2014
  • "On the Covering Property of the Lifting Region", Applied Mathematics and Statistics seminar, Johns Hopkins University.  Baltimore MD.  October 15, 2014
  • "On the Covering Property of the Lifting Region", Operations Research/Algebra and Discrete Math seminar, Clemson University.  Clemson, South Carolina.  October 8, 2014
  • "Cut Generating SDPs: A disjunctive framework for convex MINLP", Mixed-Integer Nonlinear Programming (MINLP) 2014.  Pittsburgh, PA.  June 2, 2014
  • "On the sufficiency of finite support duals in semi-infinite linear programming", SIAM conference on optimization.  San Diego, California.  May 19, 2014
  • "A unified approach to semi-infinite linear programming with applications to convex optimization", Optimization seminar, ETH Zurich.  Zurich, Switzerland.  May 12, 2014
  • "Recent progress in Gomory and Johnson's infinite group problem", AMS spring sectional meeting.  University of Maryland, Baltimore County.  March 29, 2014
  • "Recent progress in Gomory and Johnson's infinite group problem", Colloquium seminar, United States Naval Academy.  Annapolis, Maryland.  March 19, 2014
  • "Recent progress in Gomory and Johnson's infinite group problem", Integer Programming seminar, IBM T.J. Watson Research Labs.  Yorktown Heights, NY.  January 20, 2014
  • "On the unique-lifting property", 18th Aussois workshop on Combinatorial Optimization.  Aussois, France.  January 5, 2014
  • "The "In finite Group" Problem: Analysis and Combinatorics come together to solve Discrete Optimization", Applied Mathematics and Statistics seminar, Johns Hopkins University.  Baltimore MD.  October 15, 2013
  • "Recent progress in Gomory and Johnson's infinite group problem", INFORMS annual meeting.  Minneapolis, MN.  October 6, 2013
  • "Mixed-Integer Programming: A Solution Methodology", Management Science and Engineering seminar, Stanford University.  Palo Alto, California.  February 1, 2013
  • "Mixed-Integer Programming: A Solution Methodology", Operations research seminar, University of Iowa.  University of Iowa, Iowa city, Iowa.  February 1, 2013
  • "Mixed-Integer Programming: A Solution Methodology", Colloquium of the Dept. of Operations Research and Information Engineering, Cornell University.  Ithaca, NY.  February 1, 2013
  • "Fresh development in discrete optimization", Numerical optimization seminar, Mathematical Institute, Oxford University.  Oxford, England.  January 1, 2013
  • "Mixed-Integer Programming: A Solution Methodology", Operations research seminar, University of Michigan, Ann Arbor.  Ann Arbor, Michigan.  January 1, 2013
  • "Mixed-Integer Programming: A Solution Methodology", Operations research seminar, University of Chicago.  University of Chicago, Chicago, IL.  January 1, 2013
  • "Corner Polyhedra and Maximal Lattice-Free Sets: A Geometric Approach to Cutting Planes", Trends in Optimization seminar, University of Washington, Seattle.  Seattle, USA.  October 15, 2012
  • "A (k+1)-slope theorem for the infinite group problem", International Symposium on Mathematical Programming 2012.  Berlin, Germany.  August 1, 2012
  • "Corner Polyhedra and Maximal Lattice-Free Sets: A Geometric Approach to Cutting Planes", Applied Mathematics and Statistics seminar, Johns Hopkins University.  Baltimore MD.  February 15, 2012
  • "Corner Polyhedra and Maximal Lattice-Free Sets: A Geometric Approach to Cutting Planes", Quantitative Methods seminar, Purdue University.  West Lafayette, USA.  January 18, 2012
  • "Corner Polyhedra and Maximal Lattice-Free Sets: A Geometric Approach to Cutting Planes", Operations Research seminar, Massachusetts Institute of Technology.  Boston, USA.  January 15, 2012
  • "A (k+1)-slope theorem for the infinite group problem", Bay Area Discrete Math Day.  Davis, California.  October 1, 2011
  • "Unique minimal liftings in minimal inequalities", Mixed Integer Programming (MIP) 2011.  University of Waterloo, Canada.  June 1, 2011
  • "Intersection Cuts with Infinite Split Rank", INFORMS annual meeting.  November 7, 2010
  • "Convex Sets and Minimal Sublinear Functions", INFORMS annual meeting.  Austin, Texas.  November 7, 2010
  • "On lifting integer variables in minimal inequalities", INFORMS annual meeting.  Austin, Texas.  November 7, 2010
  • "Geometry of Maximal Lattice-free Sets", Algebra and Discrete Mathematics seminar, University of California, Davis.  Davis, USA.  October 15, 2010
  • "Recent trends in cutting planes for mixed-integer programs", Discrete optimization workshop, Institute for Pure and Applied Mathematics (IPAM).  Los Angeles, CA.  October 1, 2010
  • "Corner Polyhedra and Maximal Lattice-Free Sets: A Geometric Approach to Cutting Planes", Operations Research seminar, Northwestern University.  Chicago, USA.  January 15, 2010
  • "Corner Polyhedra and Maximal Lattice-Free Sets: A Geometric Approach to Cutting Planes", Operations research seminar, University of Michigan, Ann Arbor.  Ann Arbor, Michigan.  January 11, 2010
  • "On Lifting Integer Variables in Minimal Inequalities", Workshop on Multi-row Cuts.  Bertinoro, Italy.  November 19, 2009
  • "Corner polyhedra and maximal lattice-free polyhedra: a geometric approach to cutting plane theory", INFORMS annual meeting.  San Diego, California.  October 11, 2009
  • "On the relative strength of two row cuts for MILPs", INFORMS annual meeting.  San Diego, California.  October 11, 2009
  • "A counterexample to a conjecture of Gomory and Johnson", International Symposium on Mathematical Programming (ISMP) 2009.  Chicago, IL.  August 1, 2009
Back to top