Poster Awards

Awards Committee: Oktay Günlük (Cornell University), Siqian Shen (University of Michigan), Willem-Jan van Hoeve (CMU), Miles Lubin (Google)


Winner: Yatharth Dubey (Georgia Tech)

Citation: The poster committee found Yatharth Dubey's work on the multi-dimensional knapsack problem outstanding. This paper elegantly tackles a fundamental question on the size of ​the branch-and-bound trees in a relatively general setting and establishes that the size of the enumeration tree ​is polynomially bounded when the number of constraints is fixed.


Honorable Mention and Most Popular Poster: Yunhao Tang (Columbia University)

Citation: The committee recognizes the exceptional poster by Yunhao Tang. This work develops an innovative application of Reinforcement Learning to select effective Gomory cuts, creating new avenues for applying the latest developments in Machine Learning to improving MIP solving technology.


Honorable Mention: Hongyi Jiang (Johns Hopkins University)

Citation: The committee recognizes the exceptional poster by Hongyi Jiang. This work provides two strong theoretical results on the performance of cutting plane procedures for integer programs in the plane. The first is a polynomial-time cutting plane procedure, based on split cuts, to solve 2-dimensional integer programs. The second is a proof that in two dimensions the split closure has polynomial size.

Parallel Session 1 - APPLICATIONS: >>> videos <<<

  • Carolina Riascos (University of Toronto), A Lagrangian-based Branch-and-bound Algorithm Enhanced by Multi-valued Decision Diagrams for the Kidney Exchange Problem
  • Jamie Fravel (Virginia Tech), Optimal Redistricting in Virginia using Integer Programming and Markov Chain Monte Carlo Techniques
  • Hamidreza Validi (Oklahoma State University), Solving tract-level instances of political districting
  • Mario Arrieta-Prieto (Rensselaer Polytechnic Institute), Optimal location of last-mile consolidation areas to reduce environmental impact of urban deliveries of goods: a heuristic approach
  • Joshua Margolis (Clemson University), A multi-vehicle covering tour problem with speed optimization
  • Akhilesh Soni (University of Wisconsin-Madison), Mixed-Integer Linear Programming for Scheduling Unconventional Oil Field Development
  • Yijiang Li (Georgia Institute of Technology), An efficient branch-and-price approach for solving the flight gate assignment problem

Parallel Session 2 - MACHINE LEARNING: >>> videos <<<

  • Yunhao Tang (Columbia University), Reinforcement Learning for Integer Programming: Learning to Cut
  • Yongchun Li (Virginia Tech), Exact and Approximate Mixed Integer Convex Programming Formulations for Sparse PCA
  • Michael Li (MIT), Interpretable Matrix Completion: A Discrete Optimization Approach
  • Sina Aghaei (University of Southern California), Learning Optimal Classification Trees: Strong Max-Flow Formulations
  • Jongeun Kim (University of Minnesota-Twin Cities), Node packing in the hyper-rectangle conflict graph with application to tree ensembles optimization
  • Aaron Ferber (University of Southern California), MIPaaL: Mixed Integer Program as a Layer
  • Haoyue Wang (MIT), Additive Isotonic Regression with Unknown Signs

Parallel Session 3 - COMBINATORIAL OPTIMIZATION: >>> videos <<<

  • Kartik Kulkarni (Virginia Tech), Exact Algorithms for Lot-Sizing Problems with Multiple Capacities, Piecewise Concave Production Costs, and Subcontracting
  • Christopher Muir (Georgia Institute of Technology), A Dynamic Model of the Maximum Weighted Stable Set Problem
  • Gabriele Dragotto (Polytechnique Montreal), When Nash Meets Stackelberg
  • Xuan Zhang (Columbia University), Covering problems: pitch and extension complexity
  • Qimeng Yu (Northwestern University), A Polyhedral Approach for Bisubmodular Function Minimization
  • Hassan Mortagy (Georgia Institute of Technology), Electrical Flows over Spanning Trees

Parallel Session 4 - STOCHASTIC OPTIMIZATION: >>> videos <<<

  • Rui Chen (University of Wisconsin-Madison), A Cutting Plane Approach for Approximating the Lagrangian Dual Bound of a Stochastic Integer Program
  • Joshua Gunter (University of Waterloo), The complexity of branch-and-price algorithms for the capacitated vehicle routing problem with stochastic demands
  • Shixuan Zhang (Georgia Institute of Technology), Stochastic Dual Dynamic Programming for Multistage Mixed-Integer Nonlinear Optimization
  • Margarita Castro (University of Toronto), A Combinatorial Cut-and-Lift Procedure with an Application to 0-1 Chance Constraints
  • Suresh Bolusani (Lehigh University), Generalized Benders' Decomposition for Multilevel/Multistage Optimization
  • Petros Papadopoulos (Rutgers University), Opportunistic Maintenance Scheduling For Offshore Wind Farms

Parallel Session 5 - THEORY OF MIP: >>> videos <<<

  • Ryan Cory-Wright (MIT), A Unified Approach to Mixed-Integer Optimization: Nonlinear Formulations and Scalable Algorithms
  • Hongyi Jiang (Johns Hopkins University), Split Cuts in the Plane
  • Silvia Di Gregorio (University of Wisconsin-Madison), On the complexity of binary polynomial optimization over acyclic hypergraphs
  • Yatharth Dubey (Georgia Institute of Technology), An analysis of branch-and-bound for random multidimensional knapsack
  • Shengding Sun (Georgia Institute of Technology), Sparse positive semidefinite approximation of the PSD cone
  • Endric Daues (Columbia University), Computation of Hard Knapsacks via Optimized Path Integrals