MINLP 2014 at Carnegie Mellon University, Pittsburgh, PA

 

Slides of individual presentations are provided through the links below.  In addition, the entire collection of presentations is available as a single zip archive.

 

Monday, June 2, 2014

 

8:55-9:00

Welcome and opening remarks by Nick Sahinidis

 

9:00-9:45

Plenary by Robert Weismantel

MINLPs with few integer variables

 

9:45-1:40

General algorithms

9:45-10:05

Andy Conn.  A trust region method for solving grey-box mixed integer nonlinear problems.  Joint work with Claudia D'Ambrosio and Leo Liberti

10:05-10:25

Matthias Koeppe.  News on the generating function approach to mixed-integer nonlinear optimization.  Joint work with N. Berline, B. Dutra, and M. Vergne

10:25-10:45

Break

10:45-11:05

Alex Martin.  May MIP techniques help to solve MINLPs?

11:05-11:25

Lijie Su.  Improved outer approximation for mixed integer nonlinear programming.  Joint work with Lixin Tang and I. E. Grossmann

11:25-11:45

Ted Ralphs.  Generation and representation of piecewise polyhedral value functions

11:45-12:05

Francisco Trespalacios.  Cutting plane algorithm for convex generalized disjunctive programs.  Joint work with I. E. Grossmann

12:05-1:20

Lunch break

 

 

1:20-1:40

Claire Adjiman.  The branch-and-sandwich algorithm for mixed-integer nonlinear bilevel problems.  Joint work with Polyxeni-M. Kleniati

 

1:40-3:00

Problems with complementarity constraints

1:40-2:00

Larry Biegler.  Modeling and solution strategies of MINLPs as MPCCs for chemical process optimization

2:00-2:20

Antonio Conejo.  Generation investment equilibria with strategic producers.  Joint work with J. Kazempour

2:20-2:40

Ismael de Farias.  Integer programming with complementarity constraints.  Joint work with Li Ding, Ernee Kozyreff, and Ming Zhao

2:40-3:00

Jean Philippe Richard.  On the KKT formulation of network interdiction problems.  Joint work with Danial Davarnia and Mohit Tawarmalani

 

3:00-5:00

Computational complexity

3:00-3:20

Alberto Del Pia.  Integer quadratic programming in the plane

3:20-3:40

Break

3:40-4:00

Santanu Dey.  Integer quadratic programming is in NP in fixed dimension.  Joint work with Alberto Del Pia and Marco Molinaro

4:00-4:20

Robert Hildebrand.  Complexity of polynomial minimization over integer points in polyhedral.  Joint work with Alberto Del Pia, Robert Weismantel, and Kevin Zemmer

4:20-4:40

Leo Liberti.  MINLP: Turing completeness and applications to software analysis.  Joint work with Fabrizio Marinelli

4:40-5:00

Timm Oertel.   Integer optimization in variable dimension

 

5:00-6:30

Poster session and workshop reception

5:00-5:22

Oral presentations: Two minutes for each poster presenter

1.     Manish Bansal. Generalizations of continuous mixing set: Facets and extended formulations.  Joint work with Kiavash Kianfar

2.     Amitabh Basu.  Cut generating SDPs: Extending Balas' disjunctive framework to MINLP.  Joint work with Sam Burer

3.     Aksay Gupte.  New ideas on lower and upper bounds for the generalized pooling problem

4.     Irene Lotero-Herranz.  Decomposition method for mutiperiod blending scheduling.  Joint work with Francisco Trespalacios and Ignacio Grossmann

5.     Luca Mencarelli.  A heuristic algorithm for general multiple nonlinear knapsack problems.  Joint work with Claudia D’Ambrosio, Angelo Di Zio and Silvano Martello

6.     Juliane Mueller.  Surrogate model algorithm for computationally expensive mixed-integer black-box global optimization problems

7.     Miaodi Sun.  GAMS2XLS: A tool to connect MINLP test libraries to spreadsheet solvers.  Joint work with Elkafi Hassini

8.     Francisco Trespalacios.  MINLP cyber-infrastructure: www.minlp.org.  Joint work with Ignacio Grossmann.

9.     Sven Wiese.  Recent progress in nonlinear network design with applications to water networks.  Joint work with Jesco Humpola and Andrea Lodi

10.  Zach Wilson.  Best subset selection in ALAMO.  Joint work with Nick Sahinidis

11.  Sercan Yildiz.  Two-term disjunctions on the second-order cone.  Joint work with Gerard Cornuejols and Fatma Kılınc-Karzan

5:30-6:30

Workshop reception and poster exhibits

(Rangos Room, University Center)

 

 

Tuesday June 3, 2014

 

9:00-9:45

Plenary by Sanjay Mehrotra

Can interior solutions help in solving mixed integer programs?

 

9:45-12:05

Special structures: QCQP and related

9:45-10:05

Miguel Anjos.  Towards efficient higher-order semidefinite relaxations for max-cut.  Joint work with Elspeth Adams, Franz Rendl, and Angelika Wiegele

10:05-10:25

Dan Bienstock.  Recent results on solving QCQPs.  Joint work with Alexander Michalka, Gonzalo Munoz, and Irene Lo

10:25-10:45

Break

10:45-11:05

Pedro Castro.  A tighter piecewise McCormick relaxation for bilinear problems

11:05-11:25

David Gao.  Canonical duality theory for solving general mixed integer nonlinear programming problems with applications

11:25-11:45

Monique Guignard-Spielberg.  Progress and issues with SDP-based convexification and convex hull matheuristic for quadratic 0-1 problems with linear constraints.  Joint work with Lucas Letocart and Michael Bussieck

11:45-12:05

Fatma Kilinc-Karzan.  Understanding structure in conic mixed integer programs: from minimal inequalities to conic disjunctive cuts.  Joint work with Sercan Yildiz

12:05-1:20

Lunch break

 

1:20-5:40

Applications

1:20-1:40

Jose Caballero.  Integration of different models in the design of chemical processes

1:40-2:00

Sonia Cafieri.  MINLP emerging applications in air traffic management

2:00-2:20

Armin Fügenschuh.  Optimization of sticky separation in waste paper processing.  Joint work with Christine Hayn and Dennis Michaels

2:20-2:40

Nicolas Sawaya.  A useful algebraic representation of disjunctive convex sets using the perspective function.  Joint work with Kevin Furman and Ignacio Grossmann

2:40-3:00

Jeff Linderoth.  Strong convex nonlinear relaxations of the pooling problem.  Joint work with Claudia D'Ambrosio and Jim Luedtke

3:00-3:20

Jim Luedtke.  Valid inequalities for potential-constrained network design.  Joint work with Jeff Linderoth and Hyemin Jeon

3:20-3:40

Break

3:40-4:00

Justo Puerto.  Easy and not so easy continuous multifacility location problems

4:00-4:20

Hong Ryoo.  Compact 0-1 linearization of 0-1 multilinear program for pattern generation in logical analysis of data.  Joint work with Kedong Yan

4:20-4:40

Sebastian Sager.  Decoding complex cardiac arrhythmia using mathematical optimization.  Joint work with Florian Kehrle, and Eberhard Scholz

4:40-5:00

Lars Schewe.  Optimal Steiner trees subject to mechanical constraints—or: Routing steam pipes in power plants.  Joint work with Jakob Schelbert

5:00-5:20

Metin Turkay.  e-OA for the solution of bi-objective generalized disjunctive programming problems in the synthesis of nonlinear process networks.  Joint work with Ali Fattahi

 

 

6:30-8:30

Dinner at Monterrey Bay Fish Grotto, Mt. Washington.  Buses depart from CMU at 5:45

 

Wednesday June 4, 2014

 

9:00-9:45

Plenary by Tapio Westerlund

Aspects on solving convex and nonconvex MINLP problems

 

9:45-11:25

Cutting planes and convexification

9:45-10:05

Gerard Cornuejols.  Cut-generating functions.   Joint work with Conforti, Daniilidis, Lemarechal, Malick, Wolsey and Yildiz

10:05-10:25

Oktay Gunluk.  Multi-branch split cuts for mixed-integer programming.  Joint work with Sanjeeb Dash

10:25-10:45

Break

10:45-11:05

Aida Khajavirad.  On simultaneous convexification of multilinear functions.  Joint work with Alberto Del Pia

11:05-11:25

Mohit Tawarmalani.  Techniques in convexification of separable polynomial inequalities.  Joint work with Jean-Philippe P. Richard

 

11:25-4:40

Solvers and modeling environments

11:25-11:45

Pietro Belotti.  A feasibility pump for nonconvex MINLP.  Joint work with Timo Berthold

11:45-12:05

Christian Bliek.  IBM CPLEX global non-convex MIQP.  Joint work with Pierre Bonami

12:05-1:20

Lunch break

1:20-1:40

Evrim Dalkiran.  RLT-POS: Reformulation-linearization technique-based optimization software for polynomial programming problems.  Joint work with Hanif Sherali

1:40-2:00

Chris Floudas.  Advances in deterministic global optimization for mixed-integer nonlinear models.  Joint work with Ruth Misener

2:00-2:20

Ambros Gleixner.  Analyzing the computational impact of individual MINLP solver components.  Joint work with Stefan Vigerske

2:20-2:40

Marcel Hunting.  Solving MINLP problems with AIMMS

2:40-3:00

Mustafa Kilinc.  Solving MINLPs with BARON.  Joint work with Nick Sahinidis

3:00-3:20

Break

3:20-3:40

Ashutosh Mahajan.  Solving convex MINLPs using Minotaur: Presolving, cuts and more

3:40-4:00

Stefan Vigerske.  GAMS efforts in MINLP and MINLPLib 2.0

4:00-4:20

Youdong Lin.  Recent developments in the LINDO global solver.  Joint work with Linus Schrage

4:20-4:40

John Siirola.  Analyzing structured optimization models with automatic transformations.  Joint work with William Hart

 

4:40-5:40

Panel: Industrial challenges for MINLP

 

Thursday June 5, 2014

 

9:00-11:00

Risk and uncertainty

9:00-9:20

Shabbir Ahmed.  Polyhedral results for a class of cardinality constrained submodular minimization problems.  Joint work with Jiajin Yu

9:20-9:40

Paul Barton.  Nonconvex generalized Benders decomposition

9:40-10:00

Laureano Escudero.  The branch-and-fix coordination decomposition algorithm as a framework for solving multistage MINLP problems under exogenous/endogenous uncertainty.  Joint work with M.A. Garin, M. Merino and G. Perez

10:00-10:20

Stratos Pistikopoulos.  Solution strategies for mp-MILP and mp-MIQP problems.  Joint work with Richard Oberdieck

10:20-10:40

Break

 

10:40-11:00

MISOCO

10:40-11:00

Tamas Terlaky.  Mixed-integer second-order conic optimization (MISOCO): Disjunctive conic cuts and portfolio models.  Joint work with Julio Góez, Sertalp Cay, Ted Ralphs, Pietro Belotti, Imre Pólik

 

11:00-12:00

Constraints and propagation

11:00-11:20

John Chinneck.  A heuristic method for MINLP.  Joint work with M. Shafique

11:20-11:40

John Hooker.  Constraint programming techniques in MINLP

11:40-12:00

Yash Puranik.  A hybrid constraint programming/optimization based infeasibility diagnosis framework for nonconvex NLPs and MINLPs.  Joint work with Nick Sahinidis

 

12:00-12:05

Closing remarks by Ignacio Grossmann and Nick Sahinidis