{"id":34,"date":"2017-08-31T02:19:26","date_gmt":"2017-08-31T02:19:26","guid":{"rendered":"https:\/\/or.clemson.edu\/mip-2018\/?page_id=34"},"modified":"2018-05-14T12:13:58","modified_gmt":"2018-05-14T12:13:58","slug":"speakers","status":"publish","type":"page","link":"https:\/\/or.clemson.edu\/mip-2018\/program\/speakers\/","title":{"rendered":"Speakers"},"content":{"rendered":"<ul>\n<li><a href=\"https:\/\/www.linkedin.com\/in\/robert-bixby-56475758\/\"><span style=\"color: #3366ff\">Bob Bixby<\/span><\/a>, \u00a0Gurobi Optimization<br \/>\n<em style=\"font-size: 1.125rem\"><span style=\"font-size: 1rem;line-height: 35px\">Title: TBD<\/span><\/em><\/li>\n<li><a href=\"https:\/\/u.osu.edu\/chen\/\"><span style=\"color: #3366ff\">Chen Chen<\/span><\/a>, \u00a0The Ohio State University<br \/>\n<em style=\"font-size: 1rem;line-height: 35px\">Maximal outer-product-free sets for polynomial optimization<\/em><\/li>\n<li><a href=\"http:\/\/tepper.cmu.edu\/our-faculty-and-research\/about-our-faculty\/faculty-profiles\/gc0v\/cornuejols-gerard\"><span style=\"color: #3366ff\">G\u00e9rard Cornu\u00e9jols<\/span><\/a>, \u00a0Carnegie Mellon University<br \/>\n<em style=\"font-size: 1rem;line-height: 35px\">Cuboids<\/em><\/li>\n<li><a href=\"http:\/\/ieor.columbia.edu\/yuri-faenza\"><span style=\"color: #3366ff\">Yuri Faenza<\/span><\/a>, \u00a0Columbia University<br \/>\n<em style=\"font-size: 1rem;line-height: 35px\">Balas formulation for the union of polytopes is optimal<\/em><\/li>\n<li><a href=\"http:\/\/www.math.uwaterloo.ca\/~rfukasaw\/\"><span style=\"color: #3366ff\">Ricardo Fukasawa<\/span><\/a>, \u00a0University of Waterloo<br \/>\n<em style=\"font-size: 1rem;line-height: 35px\">Split cuts based on sparse disjunctions<\/em><\/li>\n<li><span style=\"color: #3366ff\"><a href=\"https:\/\/www.linkedin.com\/in\/matthew-galati-3651841\/\"><span style=\"color: #3366ff\">Matthew<\/span> <span style=\"color: #3366ff\">Galati<\/span><\/a><\/span>, \u00a0SAS Institute Inc.<br \/>\n<em style=\"font-size: 1rem;line-height: 35px\">Automatic structure detection in mixed-integer programs<\/em><\/li>\n<li><span style=\"color: #3366ff\"><a href=\"http:\/\/www.engineering.pitt.edu\/People\/Faculty\/Industrial\/Primary\/Andres-Gomez\/\"><span style=\"color: #3366ff\">Andres<\/span> <span style=\"color: #3366ff\">Gomez<\/span><\/a><\/span>, \u00a0University of Pittsburgh<br \/>\n<em style=\"font-size: 1rem\">On connections between mixed-integer fractional and conic quadratic optimization, with applications in best subset selection<\/em><\/li>\n<li><a href=\"https:\/\/sites.google.com\/site\/aidakhajavirad\/\"><span style=\"color: #3366ff\">Aida Khajavirad<\/span><\/a>, \u00a0Carnegie Mellon University<br \/>\n<em style=\"font-size: 1rem;line-height: 35px\">Stronger polyhedral relaxations for polynomial optimization problems<\/em><\/li>\n<li><span style=\"color: #3366ff\"><a href=\"http:\/\/monash.edu\/research\/explore\/en\/persons\/pierre-le-bodic(6e3e4181-4e4b-4d6c-80f5-76c7d23c45b9).html\"><span style=\"color: #3366ff\">Pierre le Bodic<\/span><\/a><\/span>, \u00a0Monash University<br \/>\n<em style=\"font-size: 1rem;line-height: 35px\">Tree-size estimates in MIP solvers<\/em><\/li>\n<li><a href=\"http:\/\/www.montefiore.ulg.ac.be\/~louveaux\/\"><span style=\"color: #3366ff\">Quentin Louveaux<\/span><\/a>, \u00a0Universit\u00e9 de Li\u00e8ge<br \/>\n<em style=\"font-size: 1rem;line-height: 35px\">Title: TBD<\/em><\/li>\n<li><a href=\"http:\/\/www.or.rwth-aachen.de\/luebbecke\/\"><span style=\"color: #3366ff\">Marco L\u00fcbbecke<\/span><\/a>, \u00a0RWTH Aachen<br \/>\n<em style=\"font-size: 1rem;line-height: 35px\">Progress in the branch-price-and-cut Solver GCG<\/em><\/li>\n<li><a href=\"https:\/\/mlubin.github.io\"><span style=\"color: #3366ff\">Miles Lubin<\/span><\/a>, \u00a0Google<br \/>\n<em style=\"font-size: 1rem;line-height: 35px\">Mixed-integer convex representability<\/em><\/li>\n<li><a href=\"http:\/\/www.stephenjmaher.com\"><span style=\"color: #3366ff\">Stephen Maher<\/span><\/a>, \u00a0Lancaster University<br \/>\n<em style=\"font-size: 1rem;line-height: 35px\">Large neighborhood Benders search<\/em><\/li>\n<li><a href=\"https:\/\/www.unibo.it\/sitoweb\/enrico.malaguti\"><span style=\"color: #3366ff\">Enrico Malaguti<\/span><\/a>, \u00a0Universit\u00e0 di Bologna<br \/>\n<em style=\"font-size: 1rem;line-height: 35px\">Integer optimization with penalized fractional values: The knapsack case<\/em><\/li>\n<li><a href=\"http:\/\/ise.utk.edu\/people\/james-ostrowski\/\"><span style=\"color: #3366ff\">Jim Ostrowski<\/span><\/a>, \u00a0University of Tennessee<br \/>\n<em style=\"font-size: 1rem;line-height: 35px\">Almost symmetry in integer programming<\/em><\/li>\n<li><a href=\"https:\/\/sites.google.com\/site\/josephspaat\/\"><span style=\"color: #3366ff\">Joe Paat<\/span><\/a>, \u00a0ETH Zurich<br \/>\n<em style=\"font-size: 1rem;line-height: 35px\">Revisiting questions in IP by reparameterizations<\/em><\/li>\n<li><a href=\"https:\/\/sites.math.washington.edu\/~raymonda\/\"><span style=\"color: #3366ff\">Annie Raymond<\/span><\/a>, \u00a0University of Washington <em style=\"font-size: 1rem;line-height: 35px\"><br \/>\nSymmetric sums of squares over k-subset hypercubes<\/em><\/li>\n<li><a href=\"https:\/\/viterbi.usc.edu\/directory\/faculty\/Sen\/Suvrajeet\"><span style=\"color: #3366ff\">Suvrajeet Sen<\/span><\/a>, \u00a0University of Southern California<br \/>\n<em style=\"font-size: 1rem;line-height: 35px\">Title: Cutting plane approximations for stochastic mixed-integer programming<\/em><\/li>\n<li><a href=\"https:\/\/people.orie.cornell.edu\/shmoys\/\"><span style=\"color: #3366ff\">David Shmoys<\/span><\/a>, \u00a0Cornell University<br \/>\n<em style=\"font-size: 1rem;line-height: 35px\">Reallocating capacity in bike-sharing systems<\/em><\/li>\n<li><a href=\"http:\/\/www.clemson.edu\/cecas\/departments\/ie\/people\/faculty\/smith.html\"><span style=\"color: #3366ff\">Cole Smith<\/span><\/a>, \u00a0Clemson University<br \/>\n<em style=\"font-size: 1rem;line-height: 35px\">Using binary\u00a0decision diagrams in solving hard binary optimization problems<\/em><\/li>\n<li><a href=\"http:\/\/www.doc.ic.ac.uk\/~wwiesema\/\"><span style=\"color: #3366ff\">Wolfram Wiesemann<\/span><\/a>, \u00a0Imperial College London<br \/>\n<em style=\"font-size: 1rem;line-height: 35px\">Distributionally robust vehicle routing<\/em><\/li>\n<\/ul>\n","protected":false},"excerpt":{"rendered":"<p>Bob Bixby, \u00a0Gurobi Optimization Title: TBD Chen Chen, \u00a0The Ohio State University Maximal outer-product-free sets for polynomial optimization G\u00e9rard Cornu\u00e9jols, \u00a0Carnegie Mellon University Cuboids Yuri Faenza, \u00a0Columbia University Balas formulation for the union of polytopes is optimal Ricardo Fukasawa, \u00a0University of Waterloo Split cuts based on sparse disjunctions Matthew Galati, \u00a0SAS Institute Inc. Automatic structure &hellip; <\/p>\n<p class=\"link-more\"><a href=\"https:\/\/or.clemson.edu\/mip-2018\/program\/speakers\/\" class=\"more-link\">Continue reading<span class=\"screen-reader-text\"> &#8220;Speakers&#8221;<\/span><\/a><\/p>\n","protected":false},"author":2,"featured_media":0,"parent":31,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"_et_pb_use_builder":"","_et_pb_old_content":"","_et_gb_content_width":"","footnotes":"","_links_to":"","_links_to_target":""},"class_list":["post-34","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/or.clemson.edu\/mip-2018\/wp-json\/wp\/v2\/pages\/34","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/or.clemson.edu\/mip-2018\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/or.clemson.edu\/mip-2018\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/or.clemson.edu\/mip-2018\/wp-json\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/or.clemson.edu\/mip-2018\/wp-json\/wp\/v2\/comments?post=34"}],"version-history":[{"count":5,"href":"https:\/\/or.clemson.edu\/mip-2018\/wp-json\/wp\/v2\/pages\/34\/revisions"}],"predecessor-version":[{"id":382,"href":"https:\/\/or.clemson.edu\/mip-2018\/wp-json\/wp\/v2\/pages\/34\/revisions\/382"}],"up":[{"embeddable":true,"href":"https:\/\/or.clemson.edu\/mip-2018\/wp-json\/wp\/v2\/pages\/31"}],"wp:attachment":[{"href":"https:\/\/or.clemson.edu\/mip-2018\/wp-json\/wp\/v2\/media?parent=34"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}