- \n
- Winner: Asteroide Santana (Georgia Tech) (collected by Santanu Dey)
\n![\"\"](\"https:\/\/or.clemson.edu\/mip-2018\/wp-content\/uploads\/sites\/2\/2018\/06\/5E2A4957-1D19-4AE5-A8B0-3E18185C58FF-compress-300x225.jpg\")
<\/li>\n - Honorable Mentions:
\nSriram Sankaranarayanan (Johns Hopkins), Sahar Tahernejad (Lehigh)
\n![\"\"](\"https:\/\/or.clemson.edu\/mip-2018\/wp-content\/uploads\/sites\/2\/2018\/06\/C61C6DDC-944C-4185-8D58-203CD0F9FB0C-300x225.jpeg\")
\u00a0 \u00a0\u00a0![\"\"](\"https:\/\/or.clemson.edu\/mip-2018\/wp-content\/uploads\/sites\/2\/2018\/06\/C29EA014-CB6E-4284-835A-66B08D76A121-compress-300x225.jpg\")
<\/li>\n<\/ul>\nPosters based on accepted extended abstracts <\/strong>(in alphabetical order):<\/p>\n
- \n
- Beste Basciftci<\/a>\u00a0<\/strong><\/span>(Georgia Tech):\u00a0Data-driven generator maintenance and operations scheduling under decision-dependent uncertainty
\n<\/em><\/li>\n- Tim Holzmann<\/span>\u00a0<\/strong>(Clemson):\u00a0A modified augmented weighted Tchebychev norm for multi-objective combinatorial optimization<\/em><\/li>\n
- Ben Knueven<\/span>\u00a0<\/strong>(Tennessee):\u00a0Tight generator schedules and unit commitment<\/em><\/li>\n
- Sascha Kuhnke<\/span><\/a>\u00a0<\/span><\/strong>(RWTH Aachen):\u00a0An adaptive discretization algorithm for the design of water usage and treatment networks<\/em><\/li>\n
- Dabeen Lee<\/a>\u00a0<\/strong><\/span>(Carnegie Mellon):\u00a0Generalized Chvatal-Gomory closures for integer programs with bounds on variables<\/em><\/li>\n
- Haochen Luo\u00a0<\/strong><\/span>(Texas A&M):\u00a0N-step cutset inequalities: facets for multi-module capacitated network design problem<\/em><\/li>\n
- Ali Irfan Mahmutogullari<\/a><\/span>\u00a0<\/strong>(Bilkent):\u00a0The value of multi-stage stochastic programming in risk-averse unit commitment problems<\/em><\/li>\n
- Joshua Margolis<\/a>\u00a0<\/strong><\/span>(Clemson):\u00a0A mixed-integer model for the volumetric modulated arc therapy treatment planning problem<\/em><\/li>\n
- Hamid Nazari\u00a0<\/strong><\/span>(Clemson):\u00a0Integer programming for equilibrium pricing<\/em><\/li>\n
- Prashant Palkar<\/a>\u00a0<\/strong><\/span>(IIT Bombay):\u00a0Mixed-Integer Derivative-Free Optimization<\/em><\/li>\n
- Sriram Sankaranarayanan<\/span>\u00a0<\/strong>(Johns Hopkins):\u00a0Can cut generating functions be good and efficient?<\/em><\/li>\n
- Asteroide Santana<\/span>\u00a0<\/strong>(Georgia Tech):\u00a0New SOCP relaxation and branching rule for bipartite bilinear programs<\/em><\/li>\n
- Thiago Serra<\/a><\/span>\u00a0<\/strong>(Carnegie Mellon):\u00a0Bounding and counting linear regions of deep neural networks<\/em><\/li>\n
- Meenarli Sharma<\/a><\/span>\u00a0<\/strong>(IIT Bombay):\u00a0Automatic reformulation techniques for mixed-integer nonlinear programs<\/em><\/li>\n
- Sahar Tahernejad<\/a><\/span>\u00a0<\/strong>(Lehigh):\u00a0Valid inequalities for mixed integer bilevel linear optimization problems<\/em><\/li>\n
- Alfredo Torrico<\/a><\/span>\u00a0<\/strong>(Georgia Tech):\u00a0Submodular maximization under matroid constraints: a case for robustness<\/em><\/li>\n
- Eli Towle<\/a>\u00a0<\/strong><\/span>(Wisconsin-Madison):\u00a0External intersection cuts<\/em><\/li>\n
- Hamidreza Validi<\/a>\u00a0<\/strong><\/span>(Oklahoma State):\u00a0A note on “A linear-size zero-one programming model for the minimum spanning tree problem in planar graphs”<\/em><\/li>\n
- Guanyi Wang<\/span>\u00a0<\/strong>(Georgia Tech):\u00a0Computational evaluation of new dual bounding techniques for sparse PCA<\/em><\/li>\n
- Jiawei Wang<\/a>\u00a0<\/strong><\/span>(UC Davis):\u00a0Characterization and approximation of strong general dual-feasible functions<\/em><\/li>\n
- Site Wang<\/span>\u00a0<\/strong>(Clemson):\u00a0POD.jl: a global MINLP solver based on adaptive piecewise linear relaxations<\/em><\/li>\n
- Zeyang Wu<\/a><\/span>\u00a0<\/strong>(Minnesota):\u00a0Optimal sequencing for a pair of square matrices<\/em><\/li>\n
- Jie Zhang<\/span>\u00a0<\/strong>(Virginia Tech):\u00a0Multi-product newsvendor problem with substitutions: a stochastic integer program perspective<\/em><\/li>\n
- Xuan Zhang<\/a><\/span>\u00a0<\/strong>(Columbia):\u00a0Legal assignments, the <\/em>EADAM algorithm, and Latin marriages<\/em><\/li>\n
- Yingqiu Zhang<\/a><\/span>\u00a0<\/strong>(Virginia Tech):\u00a0Two-stage stochastic p-order conic mixed-integer programs: tight second-stage formulation<\/em><\/li>\n
- Haoran Zhu<\/a><\/span>\u00a0<\/strong>(Wisconsin-Madison):\u00a0Relaxations for linear programs with complementarity constraints\u00a0<\/em><\/li>\n<\/ul>\n
\nInformation for Poster Presenters:<\/strong><\/p>\n
- Tim Holzmann<\/span>\u00a0<\/strong>(Clemson):\u00a0A modified augmented weighted Tchebychev norm for multi-objective combinatorial optimization<\/em><\/li>\n
- Beste Basciftci<\/a>\u00a0<\/strong><\/span>(Georgia Tech):\u00a0Data-driven generator maintenance and operations scheduling under decision-dependent uncertainty