### Introductory

- Introduction to Mixed Integer Programs and Cutting Planes
- Introduction to Cutting Plane Theory I ([video]) and II ([video])

### Branch-and-Bound Scheme

### Cutting Planes from Group Relaxation of MILPs

- Introduction to Extreme Inequalities for Group Relaxation
- Discontinuous Extreme Inequalities
- Some Facets of Two-dimensional Infinite Group Problem
- Sequential-Merge Inequalities
- Trivial Lifting of Facets from Continuous Group Problem to Mixed Integer Group Problem
- Extreme Inequalities of Infinite Group Relaxation from Mixing Inequalities
- S-free convex sets and cutting planes

### Cutting-Plane Evaluation

- Finite Split Rank of Triangle and Quadrilateral Inequalities
- Lower Bound on Split Rank of Intersection Cuts
- How Good are Sparse Cutting-Planes
- Effectiveness of Sparse Cutting-planes for Integer Programs with Sparse Constraint Matrix [video]
- Aggregation-based cutting-planes for packing and covering integer programs

### Other Classes of Cutting Planes for MILPs

- Lifting Cutting Planes using Linear Programming
- A Verification Based Method to Generate Cutting Planes for IPs
- Cutting-Planes from Two Branch Disjunctions

### Primal Heuristics

### Mixed Integer Nonlinear Programming

- Subset selection with sparse matrices
- Convex integer programming model to obtain dual bounds for sparse PCA
- Chvátal-Gomory Closure of Strictly Convex Body
- Some Properties of Convex Hulls of Integer Points Contained in General Convex Set
- Some Representability and Duality Results for Convex Mixed-integer Programs
- Integer Quadratic Programming is in NP
- Some cut-generating functions for second-order conic set

### Quadratically Constrained Quadratic Programming

- On obtaining the convex hull of quadratic inequalities via aggregations [video]
- Lifting Convex Inequalities for Bilinear Programs
- Sparse PSD approximation of the PSD cone [video]
- Convexification in Global Optimization - A Tutorial [video 1] [video 2]
- Convexification of Substructures in Quadratically Constrained Quadratic Programs
- New SOCP relaxation and branching rule for bipartite bilinear programs
- Analysis of MILP Techniques for the Pooling Problem [video]
- New Formulations and Valid Inequalities for Optimal Power Flow Problem