Mixed Integer Programming Workshop 2021

game theory machine learning mathematical software computer science theory combinatorics optimization and control

Audience:	Researchers in the topic
Conference dates:	24-May-2021 to 27-May-2021
Organizers:	Yuan Zhou*, Carla Michini, Robert Hildebrand, Yuri Faenza, Timo Berthold
	*contact for this listing

The 18th Mixed Integer Programming Workshop will be held online on May 24-27, 2021.

It will feature 21 distinguished invited speakers covering most aspects of Mathematical Optimization, an interactive, gamified MIP student poster session with 50 posters, and a casual business meeting.

Registration is free of charge. Register here: fico.zoom.us/webinar/register/2416186463858/WN_DVLhGOToQkKyvKYPiA4cQw

Find the website of MIP2021 at sites.google.com/view/mipworkshop2021/.

Upcoming talks

Past talks

Your time			Speaker	Title
Thu	May 27	17:45	Program Committee	Poster Prize + Closing Remarks
Thu	May 27	17:15	Aleksandr Kazachkov	Strengthening V-polyhedral disjunctive cuts
Thu	May 27	16:45	Jose Verschae	Symmetry breaking inequalities: Geometry and Perspectives
Thu	May 27	16:00	Jamie Haddock	The Minimum Euclidean-Norm Point on a Convex Polytope: Wolfe's Combinatorial Algorithm is Exponential
Thu	May 27	15:30	Jesús A. De Loera	Extreme behavior in linear programs and the simplex method
Thu	May 27	15:00	Noriyoshi Sukegawa	Recent Advances in Diameter of Polyhedra
Wed	May 26	18:15	All	Business Meeting
Wed	May 26	17:35	Andrea Qualizza	Discrete Optimization in Amazon Fulfillment
Wed	May 26	17:15	Thiago Serra	Scaling Up Exact Neural Network Compression by ReLU Stability
Wed	May 26	16:45	Elias Khalil	Revisiting Backdoors In Integer Programming
Wed	May 26	16:00	Christopher Hojny	Computational Aspects of Relaxation Complexity
Wed	May 26	15:30	Karthekeyan Chandrasekaran	Improving the integrality gap for multiway cut
Wed	May 26	15:00	Amitabh Basu	Complexity of cutting plane and branch-and-bound algorithms
Tue	May 25	18:15	Siqian Shen	Sequential Competitive Facility Location: Exact and Approximate Algorithms
Tue	May 25	17:45	Jannik Matuschke	LP-based Approximation for Generalized Malleable Scheduling
Tue	May 25	17:15	Gregor Hendel	Estimating the Branch-and-Bound Search Tree Size
Tue	May 25	16:45	Ambros Gleixner	Exact mixed-integer programming: a status update on MIP solving without numerical errors
Tue	May 25	16:00	Sanjeeb Dash	Integer and linear programming methods for two problems in machine learning
Tue	May 25	15:30	Fatma Kılınç-Karzan	Conic Mixed-Binary Sets: Convex Hull Characterizations and Applications
Tue	May 25	15:00	Jon Lee	Gaining or Losing Perspective for Piecewise-Linear Under-Estimators of Convex Univariate Functions
Mon	May 24	16:45	Students	Poster Session
Mon	May 24	16:00	Boshi Yang	Quadratic Programs with Non-intersecting Constraints
Mon	May 24	15:30	Daniel Bienstock	Progress on polynomial optimization
Mon	May 24	15:00	Program Committee	Opening Remarks + Gather Demo

Embed this schedule

Export series to