2013 Poster Session

Poster session and reception will be Monday, July 22 (5:00 – 7:30pm) in the Open Court of the Discovery building [1st floor next to Forum]. See 1st floor map for specific location. Hors d’oeuvres and drinks will be served.  The yellow tickets in your nametag can be used for drinks during the poster session.

Information for Poster Presenters

  • Double-faced poster boards (46“ x 46”) will be available in the WID Open Court area (see 1st floor map) at 3:00pm. Poster presenters can hang posters after 3pm.
  • Pushpins and tape will be provided at the MIP2013 registration table.
  • Posters should be removed immediately following the poster session.
  • Best Poster Award Ceremony will occur at the workshop on Thursday, July 25 at 11:45 – 12:15pm in the Forum.

 

Accepted Posters

 

  • An, B. Zeng, L. Kuznia, An efficient benders decomposition algorithm for chance-constrained MIP.
  • Angulo, S. Ahmed, S. Dey, V. Kaibel, Forbidden vertices.
  • Arslan, J-P Richard, Y. Guan, Polyhedral results for vendor managed inventory problems
  • Bansal, K. Kianfar, Generalizations of continuous mixing set: Extended formulations and facets
  • Bhardwaj, A. Atamturk, On network design under uncertain arc capacities.
  • Bodur, J. Luedtke, A stochastic integer programming approach to integrated service system staffing and scheduling problem.
  • Busing, F. D’Andreagiovanni, Robust optimization under multiband uncertainty.
  • Carvajal, G. Nemhauser, S. Ahmed, K. Furman, V. Goel, Y. Shao, Using diversification, communication and parallelism to solve mixed-integer linear problems.
  • Danandeh, B. Zeng, A cutting plane method for robust mixed integer programming.
  • Deng, S. Shen, B. Denton, Integrated models and approaches for stochastic operating room allocation and scheduling.
  • Dong, C. Maravelias, J. Pinter, J. Granger, Inventory routing in industrial gas distribution.
  • Fast, I. Hicks, An approach to the 4/3 conjecture for the linear relaxation of the traveling salesman problem.
  • Friberg, Introducing the conic benchmark library: conic mixed-integer optimization.
  • Hassanzadeh, T. Ralphs, M. Guzelsoy, A generalized Benders’ algorithm for the two-stage stochastic mixed integer optimization problem.
  • He, S. Ahmed, G. Nemhauser , Minimum concave cost flow over a grid network.
  • Hildebrand, A. Basu, M. Koeppe, New results on Gomory and Johnson’s innite group problem.
  • Jiang, Y. Guan, Cutting planes for the multi-stage stochastic unit commitment problem.
  • Johnston, D. Siegel, G. Szederkenyi, Determining weakly reversible linearly conjugate chemical reaction networks with minimal deficiency.
  • Johnston, Unextendible product bases as mixed integer programs.
  • Lin, R. Kwan, A convex hull technique and ad hoc branching methods in solving an integer multi-commodity flow (IMCF) model for train unit scheduling.
  • Michalka, D. Bienstock, Strong formulations for convex functions over non-convex domains.
  • Moazzez, K. Cheung, Generating certificates and sensitivity analysis in mixed integer programming.
  • Moran, S. Dash, O. Gunluk, On some generalizations of the split closure.
  • Myklebust, M. Sharpe, L. Tuncel, A class of bilinear MIPs and optimal product pricing models.
  • Narayanan, On the convergence of split closures of rational polyhedra.
  • Shen, Convex hull characterization of lexicographic orderings.
  • Shim, D. Lee, S. Chopra, The facets of the tree partition problem.
  • Song, J. Luedtke, Chance-constrained combinatorial optimization problems.
  • Strinka, E. Romeijn, Combining SAA and rounding to solve generalizations of the selective newsvendor problem.
  • Tezel, A. Atamturk, S. Kucukyavuz , Submodular path inequalities for capacitated fixed-charge network flow problems.
  • Yildiz, Minimal inequalities for constrained infinite relaxations of MIPs.
  • Zhao, Y. Guan, Strong formulations for stochastic lot-sizing problems.