MINLP Virtual Workshop 2021, 28 – 29 June

Due to the Covid-19 situation, the workshop will be virtual. Register: here

Registration is free-of-charge!

Presentations available here.

Vote for best presentation here.

Workshop Quiz

Mixed-integer nonlinear optimisation (MINLP) combines the modelling capabilities of mixed-integer linear programming with nonlinear programming into a flexible framework for dealing with a large variety of optimisation problems.

The MINLP Workshop brings together world-leading researcher in the field of mixed-integer nonlinear optimisation, and covers topics ranging from theoretical and algorithmic advances to  industrial applications.

The workshop covers all aspects of MINLP optimisation and its applications, including:

  • Algorithm and solver design
  • Applications in various fields
  • Convex and nonconvex MINLP
  • Optimisation theory
  • Deterministic and heuristic algorithms

Talks will be given in two parallel session by a mixture of invited and contributed talks. If you have questions, please contact minlp-2020@imperial.ac.uk

Workshop format:

The workshop will have two plenary presentations, and all the main presentations will be pre-recorded. The pre-recorded presentations are made available online before the workshop. All attendees are also encouraged to give a live 2 min taster presentation. The taster presentations are intended to highlight and advertise the research presented in the pre-recorded presentations. We hope that the taster presentations will boost interest in the pre-recorded presentations.   

We are also arranging a quiz during the workshop, and all presenters are welcome to submit questions related to your presentations. We prefer that the questions are related to the presentations to encourage attendees to watch all presentations. We do have prizes for the winners of the quiz! 

Preliminary schedule:

Day 1 (28 June) 3 – 4:30pm (UK time)

  • Opening of the workshop 
  • Taster presentations 
  • The quiz is distributed 
  • Discussions in break-out rooms 

Day 2 (29 June) 3 – 4:30pm (UK time)

  • Plenary 1
  • Quiz summary
  • Plenary 2
  • Best presentation award
  • Discussions in break-out rooms

The discussions in the break-out rooms are intended to be informal and a chance for colleagues to discuss research or just say hello to each other.

Plenary presentations:

Live streamed during the workshop.

  • Akshay Gupte (University of Edinburgh)
    • Mixed-Integer Conic Optimization — From Duality to Convex Hull Characterizations
    • We provide extended and projected formulations for the mixed-integer hull of an arbitrary conic representable set. These are exponential-sized formulations, as is to be expected for unstructured problems, but our proofs are constructive using the input data. In particular, this means that the valid inequalities in the projected formulation can be analyzed further for their correspondence to standard families of cutting planes and be used in cutting plane algorithms. Our main proof ingredient is devising a new strong dual for mixed-integer conic programs by appropriately splitting the value function of these problems into their integer and continuous restrictions and then gluing them back together. We also use different notions of what it means for a conic set to be packing-type and study their relationships to each other and faces of the cone. This is joint work with Temitayo Ajayi and Andrew Schaefer (Rice U.) and Amin Khademi (Clemson U.).
  • Gonzalo Muñoz (Universidad de O’Higgins)
    • Intersection Cuts For QCQPs Via Maximal Quadratic-free Sets
    • The generation of strong linear inequalities for QCQPs has been recently tackled by a number of authors using the intersection cut paradigm – a highly studied tool in integer programming whose flexibility has triggered these renewed efforts in non-linear settings. In this talk, we consider intersection cuts using the recently proposed construction of maximal quadratic-free sets. We describe the construction of these sets and show how to derive closed-form formulas from them to compute intersection cuts using an arbitrary quadratic inequality being violated by a vertex of an LP relaxation. We evaluate this approach with extensive computational experiments. This talk describes joint work with Antonia Chmiela and Felipe Serrano.


All the 2 min taster presentations are live streamed, and the full presentations are made available online before the workshop.

  • Andrea Lodi (Polytechnique Montreal)
  • Andreas Lundell (Åbo Akademi University)
  • Avinash Shankar Rammohan Subramanian (NTNU)
  • Coralia Cartis (University of Oxford)
  • David Bernal (Carnegie Mellon University)
  • Emily Speakman (University of Colorado Denver)
  • Fatma Kılınç-Karzan (Carnegie Mellon University)
  • Gabriele Eichfelder (Technische Universität Ilmenau)
  • Henrik A. Friberg (MOSEK ApS)
  • Ignacio Grossmann (Carnegie Mellon University)
  • Ivo Nowak (HAW Hamburg)
  • Ksenia Bestuzheva (Zuse Institute Berlin)
  • Lars Schewe (University of Edinburgh)
  • Laura Galli (University of Pisa)
  • Leo Liberti (LIX, Ecole Polytechnique)
  • Martina Kuchlbauer (Friedrich-Alexander-Universität Erlangen-Nürnberg)
  • Mathieu Tanneau (Georgia Tech)
  • Maximilian Merkert (OVGU Magdeburg)
  • Noussaiba Saadoudi (UMBB)
  • Qi Zhang (University of Minnesota)
  • Robert Hildebrand (Virginia Tech)
  • Sourour Elloumi (Ensta ParisTech)
  • Sophie Demassey (Mines Paris Tech)
  • Zsolt Csizmadia (FICO Xpress)


The Workshop is sponsored by GAMS, IBM, LocalSolver, MOSEK, and Quantitative Sciences Research Institute (QSRI) at Imperial College London

Find out more about our sponsors by following the links below:

 GAMS   IBM      LocalSolver   MOSEK     QSRI     

Organising committee

  • Miguel Anjos  
  • Pietro Belotti
  • Jan Kronqvist
  • Ruth Misener