Program for stream MINLP

TA-04: Topics in Mixed Integer Programming and Nonconvex Optimization
Stream: MINLP
Room: 1001 (building: 202)
Chair(s): Jan Kronqvist

• Distance geometry without the graph
  Leo Liberti
• Optimization over trained graph neural networks: mixed-integer formulations, symmetry breaking, and optimal molecular design
  Shiqiang Zhang
• Optimization-based algorithm for robustness enhancement of neural networks
  Shudian Zhao, Jan Kronqvist
• Solving large-scale ACOPF problems
  Matias Villagra, Daniel Bienstock

TB-04: Topics in Mixed Integer Nonlinear Programming 1
Stream: MINLP
Room: 1001 (building: 202)
Chair(s): Jan Kronqvist, Luca Mencarelli

• A combined Lagrange-Benders approach to Delay Constrained Routing
  Antonio Frangioni, Laura Galli, Enrico Sorbera
• A dual decomposition approach for convex problems with linear complementarity constraints
  Luca Mencarelli, Giandomenico Mastroeni
• On the Piecewise Convex Approximations of Two-Variables Functions
  Claudia D'Ambrosio, Antonio Frangioni, Claudio Gentile
• Efficient and effective optimization methods for sparse generalized inverses
  Jon Lee, Marcia Fampa, Gabriel Oliveira da Ponte, Luze Xu

TC-04: Recent Advances in MINLP
Stream: MINLP
Room: 1001 (building: 202)
Chair(s): Silvia Di Gregorio

• Modelling of piece-wise linear concave constraints in continous covering problems
  Liding Xu, Claudia D'Ambrosio
• A Knowledge Compilation Take on Binary Polynomial Optimization
  Silvia Di Gregorio
• Generalized convexity applied to branch-and-bound algorithms for MINLPs
  Ksenia Bestuzheva
• M-Decomposable Sets in Integer Programming
  Diego Moran

TD-04: Robust and Multi-Level Optimization
Stream: MINLP
Room: 1001 (building: 202)
Chair(s): Maximilian Merkert

• On the Complexity of the Bilevel Shortest Path Problem
  Dorothee Henke, Lasse Wulf
• Robust Optimization Under Controllable Uncertainty
  Eva Ley, Rebecca Marx, Maximilian Merkert, Tim Niemann, Sebastian Stiller
• A large and natural Class of Sigma-2- and Sigma-3-complete Problems in Bilevel and Robust Optimization
  Lasse Wulf
• A Branch-and-Bound Scheme for a Class of Partial Inverse Combinatorial Optimization Problems
  Maximilian Merkert, Eva Ley

WA-04: Algorithms for Mixed-Integer Nonlinear Programming and Nonconvex Optimization
Stream: MINLP
Room: 1001 (building: 202)
Chair(s): Jan Kronqvist

• Warm Starting of Outer Approximation for Biobjective MINLPs
  Erik Tamm, Jan Kronqvist
• Mixed-Integer Semidefinite Programming by Outer Approximation
  Jan Kronqvist
• Generating cuts with phantom branching
  Yehor Blokhin, Jan Kronqvist
• Polynomial Optimization: Tightening branch-and-bound schemes with conic constraints
  Brais González Rodríguez, Raúl Alvite Pazó, Samuel Alvite Pazó, Bissan Ghaddar, Julio González-Díaz

WB-04: Mixed Integer Nonlinear Programming and Nonconvex Optimization
Stream: MINLP
Room: 1001 (building: 202)
Chair(s): Jan Rolfes

• Convexification of optimization problems involving the Euclidean norm
  Nikolaos Sahinidis, Anatoliy Kuznetsov
• Random projections for quadratically constrained quadratic programming
  Benedetto Manca, Leo Liberti, Pierre-Louis Poirion
• Perspective Benders Cuts for Resource Allocation Problems with Separable Convex Costs
  Kang Yang, Guopeng Song
• A Safe Approximation of Distributionally Robust Problems Depending on Univariate Indicator Functions
  Jan Rolfes, Jana Dienstbier, Frauke Liers

WC-04: Applications of Mixed-Integer and Nonconvex Optimization 1
Stream: MINLP
Room: 1001 (building: 202)
Chair(s): Alireza Olama

• Bilinear Branch and Check Algorithm
  Ponpot Jartnillaphand, Hoa Bui
• Distributed Interpretable Machine Learning on GPUs
  Alireza Olama, Andreas Lundell, Jan Kronqvist
• Multiscale optimal mass transport
  Martin Ryner