The poster session was held the first evening of the workshop (July 22). The deadline for submission of abstracts to be considered for participation in the poster session was April 15, 2013.

Here are the results of the poster competition (there were 21 eligible posters):

- Best Poster Award: Manish Bansal, “Generalizations of Continuous Mixing Set: Extended Formulations and Facets“
- Honorable Mention: Gustavo Angulo, “Forbidden vertices“
- Honorable Mention: Merve Bodur, “A Stochastic Integer Programming Approach to Integrated Service System Staffing and Scheduling Problem“

**Posters**

- Yu An, “An Efficient Benders Decomposition Algorithm for Chance-constrained MIP“
- Gustavo Angulo, “Forbidden vertices“
- Ayse Arslan, “Polyhedral Results for Vendor Managed Inventory Problems“
- Manish Bansal, “Generalizations of Continuous Mixing Set: Extended Formulations and Facets“
- Avinash Bhardwaj, “On network design uncer uncertain arc capacities“
- Merve Bodur, “A Stochastic Integer Programming Approach to Integrated Service System Staffing and Scheduling Problem“
- Fabio D’Andreagiovanni, “Robust Optimization under Multiband Uncertainty“
- Rodolfo Carvajal, “Using diversification, communication and parallelism to solve mixed-integer linear programs“
- Anna Danandeh, “A Cutting Plane Method for Robust Mixed Integer Programming“
- Yan Deng, “Integrated Models and Approaches for Stochastic Operating Room Allocation and Scheduling“
- Yachao Dong, “Inventory Routing in Industrial Gas Distribution“
- Caleb Fast, “An Approach to the 4/3 Conjecture for the Linear Relaxation of the Traveling Salesman Problem“
- Henrik Friberg, “Introducing The Conic Benchmark Library: Conic Mixed-Integer Optimization“
- Anahita Hassanzadeh, “A Generalized Benders’ Algorithm for the Two-Stage Stochastic Mixed Integer Optimization Problem“
- Qie He, “Minimum concave cost flow over a grid network“
- Robert Hildebrand “New Results on Gomory and Johnson’s Infinite Group Problem“
- Ruiwei Jiang, “Cutting Planes for the Multi-Stage Stochastic Unit Commitment Problem“
- Nathaniel Johnston, “Unextendable Product Bases as Mixed Integer Programs“
- Matthew Johnston, “Determining Weakly Reversible Linearly Conjugate Chemical Reaction Networks with Minimal Deficiency“
- Zhiyuan Lin, “A convex hull technique and ad hoc branching methods in solving an integer multicommodity flow (IMCF) model for train unit scheduling“
- Alex Michalka, “Strong Formulations for Convex Functions Over Non-Convex Domains“
- Babak Moazzez, “Generating Certificates and Sensitivity Analysis in Mixed Integer Programming“
- Diego Moran, “On Some Generalizations of the Split Closure“
- Tor Myklebust, “A class of bilinear MIPs and optimal product pricing models“
- Vishnu Narayanan, “On the convergence of split closures of rational polyhedra“
- Ruobing Shen, “Convex Hull Characterization of Lexicographic Orderings“
- Sangho Shim, “The facets of the tree partition problem“
- Yongjia Song, “Chance-constrained combinatorial optimization problems“
- Zohar Strinka, “Combining SAA and rounding to solve generalizations of the selective newsvendor problem“
- Birce Tezel, “Submodular Path Inequalities for Capacitated Fixed-Charge Network Flow Problems“
- Sercan Yildiz, “Minimal Inequalities for Constrained Infinite Relaxations of MIPs“
- Chaoyue Zhao, “Strong Formulations for Stochastic Lot-Sizing Problems“