** Approximation & online algorithms
** |

H 3010 | **Scheduling, packing and covering** [...] |

Höhn | On the performance of Smith's rule in single-machine scheduling with nonlinear cost [...] |

Dürr | Packing and covering problems on the line as shortest path problems [...] |

Souza | Approximation algorithms for generalized and variable-sized bin covering [...] |

** Combinatorial optimization
** |

H 3004 | **Cycles in graphs** [...] |

Sprengel | An optimal cycle packing for generalized Petersen graphs *P(n,k)* with *k* even [...] |

Recht | A "min-max-theorem'' for the cycle packing problem in Eulerian graphs [...] |

Aoudia | 4-cycle polytope on a graph [...] |

H 3005 | **Distance geometry and applications** [...] |

Lavor | A discrete approach for solving distance geometry problems related to protein structure [...] |

Nucci | Solving the discretizable molecular distance geometry problem by multiple realization trees [...] |

Kim | Molecular distance geometry problem: A perspective from the Voronoi diagram [...] |

H 3008 | **Discrete structures and algorithms II** [...] |

Shioura | Computing the convex closure of discrete convex functions [...] |

Kamiyama | Matroid intersection with priority constraints [...] |

Peis | Resource buying games [...] |

H 3012 | **Nonlinear combinatorial optimization** [...] |

Klein | Separation algorithms for quadratic combinatorial optimization problems [...] |

Gorge | Quadratic cuts for semidefinite relaxation of combinatorial problems [...] |

Vidal | A new proposal for a lower bound in a generalized quadratic assignment problem applied to the zoning problem [...] |

H 3013 | **Inverse problems** [...] |

Catanzaro | An exact algorithm to reconstruct phylogenetic trees under the minimum evolution criterion [...] |

Gritzmann | On some discrete inverse problems: Combinatorial optimization in discrete and refraction tomography [...] |

H 3021 | **Combinatorial optimization under uncertainty** [...] |

Noorizadegan | A branch and cut approach for some heterogeneous routing problems under demand uncertainty [...] |

Zheng | Least square regret in stochastic discrete optimization [...] |

Chao | Dynamic pricing decision for a monopoly with strategic customers and price adjustment [...] |

** Complementarity & variational inequalities
** |

MA 313 | **Iterative methods for variational inequalities** [...] |

Konnov | Extended systems of primal-dual variational inequalities [...] |

Zaslavski | The extragradient method for solving variational inequalities in the presence of computational errors [...] |

Kalashnikov | Finding a conjectural variations equilibrium in a financial model by solving a variational inequality problem [...] |

** Conic programming
** |

H 2036 | **Conic relaxation approaches for scheduling and selection problems** [...] |

Natarajan | On theoretical and empirical aspects of marginal distribution choice models [...] |

Yuan | Integrated ship plan of strip coil consolidation and stowage [...] |

H 2038 | **Interior-point methods for conic programming** [...] |

Chua | Weighted analytic centers for convex conic programming [...] |

Hildebrand | A barrier on convex cones with parameter equal to the dimension [...] |

Choi | New large-update primal-dual interior-point algorithms for symmetric optimization problems [...] |

** Derivative-free & simulation-based optimization
** |

H 3003A | **Addressing noise in derivative-free optimization** [...] |

Wild | Computational noise in simulation-based optimization [...] |

Billups | Managing the trust region and sample set for regression model based methods for optimizing noisy functions without derivatives [...] |

Tröltzsch | A model-based trust-region algorithm for derivative-free optimization and its adaptation to handle noisy functions and gradients [...] |

** Finance & economics
** |

H 3027 | **Optimization and economic applications** [...] |

Lozano | Choosing the best partner for a horizontal cooperation [...] |

Meng | An interior-point path-following method for computing equilibria of an exchange economy with linear production technologies [...] |

Tatar | Asymptotic stability for the endogenous Solow model with discrete and distributed delays [...] |

** Game theory
** |

MA 005 | **Efficiency and optimization in games** [...] |

Pasquale | Logit dynamics: Expected social welfare, mixing time, and metastability [...] |

Gkatzelis | Truthful mechanisms for proportionally fair allocations [...] |

Christodoulou | Coordination mechanisms for selfish routing games [...] |

MA 043 | **Game theory in supply chain management** [...] |

Arthanari | Game theory and supply chain management: A survey [...] |

Carfì | Game theoretic modeling of supply chain coopetition among growers [...] |

** Global optimization
** |

H 2053 | **Advances in global optimization II** [...] |

Orlov | On an approach to special nonlinear bilevel problems [...] |

Chinneck | Better placement of local solver launch points for global optimization [...] |

Doagooei | Global optimization on the difference of sub-topical functions [...] |

** Implementations & software
** |

H 1058 | **Modeling languages and software II** [...] |

Hochreiter | Optimization modeling using R [...] |

Schulz | Enterprise-class optimization-based solutions with CPLEX Optimization Studio and SPSS predictive analytics [...] |

Lopes | Network optimization and beyond in SAS/OR Software [...] |

** Integer & mixed-integer programming
** |

H 0104 | **Strong relaxations for stable set and lot sizing** [...] |

Giandomenico | An ellipsoidal relaxation for the stable set problem [...] |

Rossi | A branch-and-cut for the stable set problem based on an ellipsoidal relaxation [...] |

Wolsey | The one warehouse multiple retailer problem with start-ups and constant capacities [...] |

H 2013 | **Network analysis** [...] |

Molinero | Variations in strict separating systems representing a linearly separable function [...] |

Müller | Cycle free flows in large-scale metabolic networks [...] |

Wiesberg | Computing role structures in networks [...] |

H 2032 | **Branch-and-price III: New techniques** [...] |

Bergner | Packing cuts with column generation [...] |

Gamst | An exact approach for aggregated formulations [...] |

Desrosiers | Row-reduced column generation for highly degenerate master problems [...] |

** Life sciences & healthcare
** |

MA 376 | **Scheduling, assignment and matching in healthcare** [...] |

Trautsamwieser | A branch-and-price approach for solving medium term home health care planning problems [...] |

Jafariasbagh | Optimal individual matching to evaluate treatment in the stroke trails [...] |

Kirchner | Appointment scheduling in a hospital environment [...] |

** Logistics, traffic, and transportation
** |

H 0106 | **Traffic assignment** [...] |

Perederieieva | Solving the time surplus maximisation bi-objective user equilibrium model of traffic assignment [...] |

Gasnikov | Stochastic optimization in the model of correspondences matrix calculation and traffic flow distribution [...] |

Chiou | Modeling the performance reliability in an area traffic control road network under uncertainty [...] |

MA 042 | **Synchronization and collision avoidance** [...] |

Martin-Campo | On solving the aircraft collision avoidance problem for the ATM by horizontal maneuvers. A ranked mutiobjective MINLO problem [...] |

Quttineh | Aircraft mission planning [...] |

Gellert | Scheduling multiple cranes on a shared pathway [...] |

** Mixed-integer nonlinear programming
** |

MA 041 | **Convex approaches for quadratic integer programs** [...] |

Letchford | A new separation algorithm for the Boolean quadric and cut polytopes [...] |

Fischer | The asymmetric quadratic traveling salesman problem [...] |

Mitchell | Quadratic programs with complementarity constraints [...] |

** Nonlinear programming
** |

H 0107 | **Algorithms and applications I** [...] |

Cartis | On the evaluation complexity of constrained nonlinear programming [...] |

Wang | An augmented Lagrangian trust region method for nonlinear programming [...] |

Wu | Computation of optimal strategies for evolutionary games [...] |

H 0110 | **Interior-point methods for linear programming** [...] |

Oliveira | Continued iteration and simple algorithms on interior point methods for linear programming [...] |

Casacio | New preconditioners for interior point methods in linear programming [...] |

Santos | A polynomial optimization subproblem in interior-point methods [...] |

H 0112 | **Semidefinite and DC programming** [...] |

Alolyan | Zeros of quadratic interval polynomials [...] |

** Nonsmooth optimization
** |

H 1012 | **Policy iteration algorithms and some applications** [...] |

Zidani | Some convergence results for the policy iterations algorithm. [...] |

Witte | Penalty methods for the solution of discrete HJB equations - continuous control and obstacle problems [...] |

Gaubert | Policy iteration algorithm for zero-sum stochastic games with mean payoff [...] |

** Optimization in energy systems
** |

MA 549 | **Optimization in the natural gas markets** [...] |

Erbs | Application of stochastic dual dynamic programming to the analysis of natural gas markets [...] |

Ibrahim | A stochastic generalized Nash-Cournot model for the European gas market. The S-GaMMES model. [...] |

Tomasgard | Multi-stage stochastic programming for natural gas infrastructure design [...] |

MA 550 | **Bilevel programming and housing retrofit** [...] |

Zak | Bilevel Programming for combinatorial auctions in electricity markets [...] |

Gross | Risk averse bilevel problems in energy markets [...] |

Jennings | Optimization of technology investments and capital management in an urban energy system housing retrofit project: Use of rolling horizons in a London borough study [...] |

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

H 0111 | **PDE optimization in medicine II** [...] |

Barnard | Optimal radiotherapy treatment planning using minimum entropy models [...] |

Nagaiah | Numerical solutions for boundary control of bidomain equations in cardiac electrophysiology [...] |

Kirchner | Large deformation diffeomorphic metric mapping using conforming adaptive finite elements [...] |

MA 415 | **Theory and methods for PDE-constrained optimization problems with inequalities** [...] |

Silva Alvarez | Characterization of quadratic growth for strong minima in the optimal control of semi-linear elliptic equations [...] |

Weiser | Goal-oriented estimation for nonlinear optimal control problems [...] |

Kruse | An infeasible interior point method for optimal control problems with state constraints [...] |

** Robust optimization
** |

MA 004 | **Multistage robustness** [...] |

Wolf | Accelerating nested Benders decomposition with game-tree search techniques to solve quantified linear programs [...] |

Habermehl | Robust design of active trusses via mixed integer nonlinear semidefinite programming [...] |

Goerigk | A geometric approach to recovery robustness [...] |

** Sparse optimization & compressed sensing
** |

H 1028 | **Nonconvex sparse optimization** [...] |

Wen | Alternating direction augmented Lagrangian methods for a few nonconvex problems [...] |

Solombrino | Linearly constrained nonsmooth and nonconvex minimization [...] |

Lai | On the Schatten p-quasi-norm minimization for low rank matrix recovery [...] |

** Stochastic optimization
** |

MA 141 | **Two-stage stochastic programming and beyond** [...] |

Drapkin | Decomposition methods for optimization problems with stochastic order constraints induced by linear recourse [...] |

Henkel | Some remarks on linear stochastic bilevel programs [...] |

Wollenberg | Stochastic vehicle routing in forwarding agencies [...] |

MA 144 | **Large-scale and multi-stage stochastic optimization** [...] |

Timonina | Multi-stage stochastic optimisation and approximations with applications [...] |

Pichler | Approximation of stochastic processes [...] |

Nino-Mora | Sufficient indexability conditions for real-state restless bandit projects via infinite-dimensional LP-based partial conservation laws [...] |

** Telecommunications & networks
** |

H 3002 | **Network clustering** [...] |

Ovelgönne | Ensemble learning for combinatorial optimization: Modularity maximization and beyond [...] |

Schumm | Experiments on density-constrained graph clustering [...] |

Sun | Low complexity interference alignment algorithms for desired signal power maximization problem of MIMO channels [...] |

H 3503 | **Paths, trees and flows** [...] |

Franco | A new linear time algorithm to construct dominator trees of reducible flow graphs [...] |

Fernandez | A compact formulation for the optimum communication spanning tree problem [...] |

Lindberg | Updating shortest path subproblem solutions in large scale optimization [...] |

** Variational analysis
** |

H 2035 | **Stability of constraint systems** [...] |

Izmailov | Strong regularity and abstract Newton schemes for nonsmooth generalized equations [...] |

Henrion | On (co-)derivatives of the solution map to a class of generalized equations [...] |

Lopez | Lower semicontinuity of the feasible set mapping of linear systems relative to their domains [...] |

H 2051 | **Variational analysis of optimal value functions and set-valued mappings with applications** [...] |

Bounkhel | Regularity concepts of perturbed distance functions at points outside of the set in Banach spaces [...] |

Kum | A geometric mean of parameterized arithmetic and harmonic means of convex functions [...] |

Yen | Coderivatives of a Karush-Kuhn-Tucker point set map and applications [...] |

MA 649 | **Variational methods in inverse problems** [...] |

Klann | A Mumford-Shah type approach for tomography data [...] |

Pricop-Jeckstadt | Genomic selection and iterative regularization methods [...] |

Pöschl | TV-denoising and evolution of sets [...] |