** Special sessions
** |

MA 041 | **Tucker session** [...] |

| Presentation by Tucker Prize Finalist #1 [...] |

| Presentation by Tucker Prize Finalist #2 [...] |

| Presentation by Tucker Prize Finalist #3 [...] |

** Approximation & online algorithms
** |

H 3010 | **Approximation in routing and others** [...] |

An | Improving Christofides' algorithm for the *s-t* path TSP [...] |

Schalekamp | On the integrality gap of the subtour LP for the 1,2-TSP [...] |

Shmoys | A primal-dual approximation algorithm for min-sum single-machine scheduling problems [...] |

** Combinatorial optimization
** |

H 3004 | **Combinatorial optimization in chip design I** [...] |

Markov | A primal-dual Lagrange optimization for VLSI global placement [...] |

Struzyna | Quadratic and constrained placement in chip design: Global flows and local realizations [...] |

Brenner | Fractional versus integral flows: A new approach to VLSI legalization [...] |

H 3005 | **Triangulations** [...] |

Pournin | The flip-graph of the 4-dimensional cube is connected [...] |

Schmiedl | Gromov-Hausdorff distance of finite metric spaces [...] |

H 3008 | **Rational convex programs and combinatorial algorithms for solving them** [...] |

Goel | A perfect price discrimination market model, and a rational convex program for it [...] |

Vazirani | Rational convex programs [...] |

Jain | Eisenberg-Gale markets: Algorithms and game theoretic properties [...] |

H 3012 | **Matching** [...] |

Knust | Scheduling sports tournaments on a single court based on special 2-factorizations [...] |

Takamatsu | Matching problems with delta-matroid constraints [...] |

Kapralov | On the communication and streaming complexity of maximum bipartite matching [...] |

H 3013 | **Combinatorial optimization in railways I** [...] |

Imaizumi | A column generation approach for crew rostering problem in a freight railway company in Japan [...] |

Schlechte | Recent developments in railway track allocation [...] |

Weider | A rapid branching method for the vehicle rotation planning problem [...] |

H 3021 | **Scheduling algorithms I** [...] |

Pruhs | Online primal-dual for non-linear optimization with applications to speed scaling [...] |

Svensson | On the hardness of scheduling with precedence constraints to minimize makespan [...] |

Stein | How to schedule when you have to buy your energy [...] |

** Complementarity & variational inequalities
** |

MA 313 | **Optimization and equilibrium models in energy systems** [...] |

Gabriel | A new method for MPECs with a natural gas application [...] |

Fan | A stochastic variational inequality model for estimating traffic demand based on random link flow observations [...] |

Bai | Biofuel supply chain design under competitive agricultural land use and feedstock market equilibrium [...] |

** Conic programming
** |

H 2036 | **Geometry and duality in convex programming** [...] |

Waki | Computation of facial reduction algorithm [...] |

Roshchina | Partition and complementarity in multifold conic systems [...] |

Guler | Efficient first-order methods for convex programming [...] |

H 2038 | **Applications of semidefinite optimization** [...] |

Hungerländer | Semidefinite optimization approaches to some facility layout problems [...] |

Vieira | Relationships between minimal unsatisfiable subformulas and semidefinite certificates of infeasibility [...] |

** Constraint programming
** |

H 3003A | **Constraint-based scheduling** [...] |

Cire | MDD propagation for disjunctive scheduling [...] |

Laborie | Conditional interval variables: A powerful concept for modeling and solving complex scheduling problems [...] |

** Finance & economics
** |

H 3027 | **Applications of stochastic programming to finance and insurance** [...] |

Consiglio | Convex lower bounding to generate multi-asset, arbitrage-free, scenario trees [...] |

Gulpinar | Robust investment decisions for asset liability management [...] |

Consigli | Institutional asset-liability management for a large P&C insurance company [...] |

** Game theory
** |

MA 043 | **Games in networks** [...] |

Elliott | A network centrality approach to coalitional stability [...] |

Bimpikis | Competitive marketing strategies over social networks [...] |

** Global optimization
** |

H 2053 | **Optimization models and methods for computer vision** [...] |

Kolmogorov | Message passing algorithms for MAP-MRF inference [...] |

Cremers | Convex relaxation techniques with applications in computer vision [...] |

Collins | Random walks based multi-image segmentation: Quasiconvexity results and GPU-based solutions [...] |

** Implementations & software
** |

H 1058 | **Testing environments for machine learning and compressed sensing** [...] |

Friedlander | Spot: A linear-operator toolbox for Matlab [...] |

Scheinberg | Studying effects of various step selection strategies in first order approaches to compressed sensing and other composite optimization problems [...] |

Lorenz | Constructing test instances for basis pursuit denoising [...] |

** Integer & mixed-integer programming
** |

H 2013 | **Column generation and decomposition** [...] |

Ozpeynirci | Allocation of proposals to reviewers to facilitate effective ranking: A branch and price approach [...] |

Lusby | A column generation approach for solving the patient admission scheduling problem [...] |

H 2032 | **Integer programming algorithms I** [...] |

Dang | A fixed-point iterative approach to integer programming and distributed computation [...] |

Rehn | Exploiting symmetry in integer convex optimization using core points [...] |

Oertel | Convex integer minimization in fixed dimension [...] |

MA 004 | **Advances in integer programming** [...] |

Deza | Combinatorial, computational, and geometric approaches to the colourful simplicial depth [...] |

Puerto | Ordered weighted average optimization of combinatorial problems [...] |

Köppe | A discretization-free FPTAS for polynomial optimization over the mixed-integer points in a class of polytopes of varying dimension [...] |

MA 042 | **Recent progress in MIP** [...] |

Molinaro | Strength of cross cuts [...] |

Dash | On t-branch split cuts for mixed-integer programs [...] |

Balas | Cut generating points on the boundary of a lattice-free convex set [...] |

** Life sciences & healthcare
** |

H 2033 | **Computational genomics** [...] |

Richard | Fiona: Automatic correction of sequencing errors in genome sequencing experiments [...] |

D'Addario | DNA sequence design [...] |

Hajirasouliha | Next-generation sequence characterization of complex genome structural variation. [...] |

** Logistics, traffic, and transportation
** |

H 0106 | **Facility location and p-median problems** [...] |

Garcia Quiles | On the *p*-median problem with uncertainty in the cost matrix [...] |

Xavier | Solving the Fermat-Weber location problem by the hyperbolic smoothing approach [...] |

Sural | The dynamic p-median problem with relocation [...] |

H 0111 | **Supply chain optimization** [...] |

Geunes | Multi-period price promotions in a single-supplier, multi-retailer supply chain under asymmetric demand information [...] |

Romero Morales | A multi-objective economic lot-sizing problem with environmental considerations [...] |

Strinka | Approximation algorithms for risk-averse selective newsvendor problems [...] |

** Mixed-integer nonlinear programming
** |

MA 005 | **Global mixed-integer nonlinear optimization I** [...] |

Grossmann | Using convex nonlinear relaxations in the global optimization of nonconvex generalized disjunctive programs [...] |

Bogataj | A multilevel approach to global optimization of MINLP problems [...] |

Westerlund | A reformulation framework for global optimization [...] |

** Multi-objective optimization
** |

H 1029 | **Linear and integer multiobjective optimization** [...] |

Kallio | Reference point method for multi-criteria optimization with integer variables [...] |

Ehrgott | A multi-objective linear programming approach to data envelopment analysis [...] |

** Nonlinear programming
** |

H 0107 | **Methods for nonlinear optimization I** [...] |

Liu | How does the linear independence assumption affect algorithms of nonlinear constrained optimization [...] |

Mommer | A nonlinear preconditioner for experimental design problems [...] |

Dussault | The behaviour of numerical algorithms without constraint qualifications [...] |

H 0110 | **Nonlinear optimization I** [...] |

Eckstein | Alternating direction methods and relative error criteria for augmented Lagrangians [...] |

Chin | A family of second order methods for L1 convex optimization [...] |

Solntsev | Dynamic batch methods for L1 regularized problems and constrained optimization [...] |

H 0112 | **Algorithms for optimal control I** [...] |

Janka | Separable formulations of optimum experimental design problems [...] |

Hatz | Hierarchical dynamic optimization - Numerical methods and computational results for estimating parameters in optimal control problems [...] |

Gräser | Truncated nonsmooth newton multigrid methods for nonsmooth minimization [...] |

** Nonsmooth optimization
** |

H 1012 | **Iterative methods for variational analysis** [...] |

Jean-Alexis | The second order generalized derivative and generalized equations [...] |

Baier | Set-valued Newton's method for computing convex invariant sets [...] |

Farkhi | The directed subdifferential and applications [...] |

** Optimization in energy systems
** |

MA 549 | **Optimization models to manage risk and uncertainty in power systems operations** [...] |

Street | Energy and reserve scheduling under a joint GT *n-K* security criterion: An adjustable robust optimization approach [...] |

Zhao | Adaptive robust optimization for the security constrained unit commitment problem [...] |

Papavasiliou | Applying high performance computing to multi area stochastic unit commitment for high wind penetration [...] |

MA 550 | **Unit commitment and inventory problems** [...] |

Koc | Parallel branch-cut-price for solving multistage stochastic unit commitment problems [...] |

Lai | A stochastic approach to power inventory optimization [...] |

Schulze | Decomposition methods for stochastic unit commitment [...] |

** PDE-constrained optimization & multi-level/multi-grid methods
** |

MA 415 | **Applications of PDE-constrained optimization** [...] |

Pinnau | Exploiting model hierarchies in space mapping optimization [...] |

Ulbrich | An adaptive semismooth Newton-CG method for constrained parameter identification in seismic tomography [...] |

** Robust optimization
** |

H 3503 | **Extensions of robust optimization models** [...] |

Todd | A robust robust (sic) optimization result [...] |

Pfeuffer | An extension of the controlled robustness model of Bertsimas and Sim [...] |

** Sparse optimization & compressed sensing
** |

H 1028 | **New models and algorithms in sparse optimization** [...] |

Boumal | Riemannian algorithms and estimation bounds for synchronization of rotations [...] |

Davenport | A simple framework for analog compressive sensing [...] |

Recht | Atomic norm denoising with applications to spectrum estimation and system identification [...] |

** Stochastic optimization
** |

MA 141 | **Advances in stochastic optimization** [...] |

Brown | Optimal sequential exploration: Bandits, clairvoyants, and wildcats [...] |

Moallemi | Pathwise optimization for linear convex systems [...] |

Caramanis | Optimization at all levels: Probabilistic Envelope Constraints [...] |

MA 144 | **Optimization of physical systems under uncertainty** [...] |

Zavala | Stochastic optimization: Impacts on electricity markets and operations [...] |

Pagnoncelli | The optimal harvesting problem under risk aversion [...] |

Luedtke | Branch-and-cut approaches for chance-constrained formulations of reliable network design problems [...] |

MA 376 | **Decisions policies and estimation techniques in a stochastic environment** [...] |

Haensel | A SP approach for decision-dependent uncertainty in production planning under non-compliance risk [...] |

Bastin | On the combination of Hessian approximations for data estimation [...] |

Yang | Approximate dynamic programming with Bézier curves/surfaces for top-percentile traffic routing [...] |

** Telecommunications & networks
** |

H 3002 | **Optical access networks** [...] |

Hervet | Robust optimization of optical fiber access networks deployments [...] |

Lopes | Modelling the minimum cost PON access network design problem [...] |

Maurer | Lagrangian approaches to a two-level FTTX network design problem [...] |

** Variational analysis
** |

H 2035 | **Nonsmooth phenomena in optimal control** [...] |

Meyer | Boundary control of the obstacle problem [...] |

Gerdts | Globalized semi-smooth Newton methods in optimal control problems with DAEs [...] |

Schmidt | Properties of the optimal value function and application to worst-case robust optimal control problems [...] |

H 2051 | **Equilibrium problems and related topics** [...] |

Ferreira | Local convergence of Newton's method under majorant condition in Riemannian manifolds [...] |

Scheimberg | A reflection-projection method for equilibrium problems [...] |

Drummond | New strategies for vector optimization problems [...] |