Poster Awards:

Winner:

Yongchun Li, Virginia Tech. Approximation Algorithms of Maximum Entropy Sampling Problem.

Citation: The committee found Yongchun Li's work outstanding. It tackles an important and difficult nonlinear discrete optimization problem on which progress is scarce, and it provides several angles of attack, proposing a new relaxation, stronger approximation algorithms, and a novel analysis of a popular heuristic. For these reasons, Yongchun's poster is selected as this year's winner.

Runner ups:

• Silvia Di Gregorio, University of Wisconsin-Madison. Chvátal Rank in Binary Polynomial Optimization.
• Hussein Hazimeh, Massachusetts Institute of Technology. Learning Sparse Hierarchical Interactions at Scale.

Award Committee:

• Friedrich Eisenbrand, École Polytechnique Fédérale de Lausanne.
• Mary Fenelon, Mathworks.
• Matthias Köppe, University of California Davis.
• Giacomo Nannicini, IBM.

Poster Finalists:

• Chvátal Rank in Binary Polynomial Optimization. Silvia Di Gregorio, University of Wisconsin-Madison.
• A Two-stage Stochastic Programming Approach for the Stochastic Collaborative Operating Room Scheduling Problem. Cheng Guo, University of Toronto.
• Exact Augmented Lagrangian Duality for Mixed Integer Quadratic Programming. Xiaoyi Gu, Georgia Institute of Technology.
• New Applications of Superadditivity in Integer Programming. Temitayo Ajayi, Rice University.
• Knapsack over Time: Polyhedra and Algorithms. Lingyi Zhang, Columbia University.
• A Compact Extended Formulation for the A-Odd Cycle Inequalities of the BoxQP. Bernd Perscheid, Trier University.
• The Aggregation Closure for Packing and Covering Polyhedra are Polyhedra. Haoran Zhu, University of Wisconsin-Madison.
• Isolation Branching: A Branch and Bound Algorithm for the k-Terminal Cut Problem. Mark Velednitsky, University of California, Berkeley.
• Reward-Driven Branching Policies. Giulia Zarpellon, Polytechnique Montreal.
• Adaptive Two-Stage Stochastic Programming. Beste Basciftci, Georgia Institute of Technology.
• Polyhedral Approximation for Mixed-integer Polynomial and Moment Problems Using Low-dimensional Generalized Sum-of-squares Cones. Chris Coey and Lea Kapelevich, Massachusetts Institute of Technology.
• Cutting Planes for Mixed-Integer Conic Programming. Mathieu Tanneau, Polytechnique Montreal.
• Multistage Distributionally Robust Mixed-Integer Programming with Decision-Dependent Ambiguity Sets. Xian Yu, University of Michigan.
• Aspects of Symmetry for Sparse Reflexive Generalized Inverses. Luze Xu, University of Michigan.
• Imposing Contiguity Constraints in Political Districting Models. Hamidreza Validi, Oklahoma State University.
• Benders Cut Classification for Two-stage Stochastic Integer Programs via Support Vector Machines. Huiwen Jia, University of Michigan.
• Probabilistic Cross-identification of Multiple Catalogs in Crowded Fields. Xiaochen Shi, Georgia Institute of Technology.
• Efficient Trust Region Methods for Inverse Mixed Integer Optimization. Ian Yihang Zhu, University of Toronto.
• Approximation Algorithms for the Multiple Knapsack Problem with Grouped Items. Francisco J. Castillo Zunino, Georgia Institute of Technology.
• Distributionally Robust Combinatorial Bottleneck Problems under Wasserstein Distance. Jie Zhang, Virginia Tech.
• Approximation Algorithms of Maximum Entropy Sampling Problem. Yongchun Li, Virginia Tech.
• A Cross-Validation Subset Selection Regression. Dennis Kreber, Trier University.
• Learning Sparse Hierarchical Interactions at Scale. Hussein Hazimeh, Massachusetts Institute of Technology.
• Integer Programming through Lexicography: Hierarchies, Algorithms, and Cutting Plane Methods. Yiran Zhu, Clemson University.
• Stochastic Modeling for Investments in Transmission Grid Resiliency. Emma S. Johnson, Georgia Institute of Technology.

Poster Presenters:

• A Scalable Algorithm for Sparse and Robust Portfolios. Ryan Cory-Wright, Massachusetts Institute of Technology.
• Office-Based and Home-Care for Older Adults in Primary Care: a Comparative Analysis using the Nash Bargaining Solution. Jennifer Mendoza-Alonzo, University of South Florida.
• Algorithmic Configuration by Learning and Optimization. Gabriele Iommazzo, CNRS LIX, Palaiseau.
• Contingency-Constrained Unit Commitment with Preventive and Corrective Transmission Switching. Raphael Saavedra, Pontifical Catholic University of Rio de Janeiro.
• Combinatorial Lower Bounds for the Double-Row Facility Layout Problem and its Special Cases. Mirko Dahlbeck, Technical University Dortmond.
• Learning a Cutting Plane Selection Policy. Antoine Prouvost, Polytechnique de Montreal.
• On aircraft Deconfliction by Bilevel Programming. Martina Cerulli, CNRS LIX, Palaiseau.
• A Multi-Vehicle Covering Tour Problem with Time Window, Energy, and Coverage Constraints. Joshua T. Margolis, Clemson University.
• Sequence Independent Lifting for Maximizing Submodular Functions with Disjoint Cardinality Constraints. Xueyu Shi, University of Pittsburgh.
• Distance Between Vertices of Lattice Polytopes. Zhongyan Guan, McMaster University.
• A Branch-and-Price Decomposition Algorithm Applied to a Management Zone Delineation and Crop Planning Problem. Gabriel E. Zamora, Universidad Técnica Federico Santa María.
• A Fast Approximate Method for the Optimization of Long-Horizon Tank Blending and Scheduling Operations in a Chemical Plant. Benjamin Beach, Virginia Tech.
• A MIP Formulation for Data-Driven Robust Futures Portfolio Optimization. Andrew Rosemberg, Pontifical Catholic University of Rio de Janeiro.
• A Mixed-Integer Programming formulation for Equipment Balancing Problem in Service Networks. Yassine Ridouane, Georgia Institute of Technology.
• Integer Programming, Constraint Programming, and Hybrid Decomposition Approaches to Discretizable Distance Geometry Problems. Moira MacNeil, University of Toronto.
• An Approximation Algorithm for Training One-Node ReLU Neural Network. Guanyi Wang, Georgia Institute of Technology.
• Derivation and Generation of Path-Based Valid Inequalities for Transmission Expansion Planning and Optimal Transmission Switching. J. Kyle Skolfield, Arizona State University.
• Solving a Generalized Assembly Line Balancing Problem of Type E. Nico Andre Schmid, Ghent University.
• Black Box Combinatorial Optimization with Monotone Structure. Nam Ho-Nguyen, Carnegie Mellon University.
• Consistent Routing with Simultaneous Pickups and Deliveries. Mohsen Emadikhiav, University of Connecticut.
• Optimization Algorithms for the Bin Packing Problem with Minimum Color Fragmentation. Saharnaz Mehrani, University of Connecticut.
• A Fast Exact Algorithm for a Minimum Convex Cost Network Flow Problem on the Dynamic Lot Size Network. Zeyang Wu, University of Minnesota.
• Sort Plan Design for Express Parcel Sortation Systems using Mixed-Integer Programming. Reem Khir, Georgia Institute of Technology.
• Dynamic Resource Allocation in Cloud Computing. Sebastian Perez-Salazar, Georgia Institute of Technology.