Volume 12, Issue 2

June 2020

Special Issue: The 2018 Mixed Integer Programming workshop

Issue Editors:

7 articles in this issue

Special issue forward: the 2018 Mixed Integer Programming workshop
Daniel Bienstock
Giacomo Nannicini
Editorial 20 May 2020 Pages: 131 - 131
On integer and bilevel formulations for the k-vertex cut problem
Fabio Furini
Ivana Ljubić
Paolo Paronuzzi
Full Length Paper 31 July 2019 Pages: 133 - 164
On the impact of running intersection inequalities for globally solving polynomial optimization problems
Alberto Del Pia
Aida Khajavirad
Nikolaos V. Sahinidis
Full Length Paper 06 August 2019 Pages: 165 - 191
K-adaptability in two-stage mixed-integer robust optimization
Anirudh Subramanyam
Chrysanthos E. Gounaris
Wolfram Wiesemann
Full Length Paper Open access 06 November 2019 Pages: 193 - 224
A novel matching formulation for startup costs in unit commitment
Bernard Knueven
James Ostrowski
Jean-Paul Watson
Full Length Paper 24 February 2020 Pages: 225 - 248
Outer approximation with conic certificates for mixed-integer convex problems
Chris Coey
Miles Lubin
Juan Pablo Vielma
Full Length Paper 20 February 2020 Pages: 249 - 293
Split cuts from sparse disjunctions
Ricardo Fukasawa
Laurent Poirrier
Shenghao Yang
Full Length Paper 04 March 2020 Pages: 295 - 335

Search