** Approximation & online algorithms
** |

H 3010 | **Real-time scheduling** [...] |

Niemeier | Scheduling with an orthogonal resource constraint [...] |

van der Ster | Mixed-criticality scheduling of sporadic task systems on a single machine [...] |

Chen | Resource augmentation in real-time systems [...] |

** Combinatorial optimization
** |

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

Suhl | Lagrangian relaxation and quadratic minimum cost flows for gate sizing [...] |

Bartoschek | Fast buffering of repeater trees [...] |

Held | Delay bounded Steiner trees and time-cost tradeoffs for faster chips [...] |

H 3005 | **Structural graph theory and methods** [...] |

Oum | Vertex-minors and pivot-minors of graphs [...] |

Joret | Excluded forest minors and the Erdös-Pósa Property [...] |

Norine | Pairs of disjoint cycles [...] |

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

Kijima | Efficient randomized rounding in permutahedron [...] |

Pap | Characterizing and recognizing generalized polymatroids [...] |

Massberg | Dual consistency and cardinality constrained polytopes [...] |

H 3012 | **Scheduling I** [...] |

Steiner | Scheduling and the traveling salesman problem on permuted monge matrices [...] |

Rieger | Two variants of flexible job shop scheduling with blockages [...] |

Stougie | Scheduling with job-splitting and fixed setup [...] |

H 3013 | **Recoverable robust combinatorial optimization** [...] |

Büsing | *k*-distance recoverable robustness [...] |

Koster | The recoverable robust knapsack problem [...] |

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

Rutten | Scheduling sporadic tasks on unrelated parallel machines [...] |

Wiese | A new approach to online scheduling: Approximating the optimal competitive ratio [...] |

Megow | Nearly optimal universal solutions for knapsack and sequencing on an unreliable machine [...] |

** Complementarity & variational inequalities
** |

MA 041 | **Game theoretic analysis and optimization for resource allocation in communication systems** [...] |

Stanczak | Progress and challenges in decentralized resource allocation optimization [...] |

Luo | Linear precoder optimization and base station selection for heterogeneous networks [...] |

Scutari | Monotone communication games [...] |

MA 313 | **Optimization and equilibrium problems I** [...] |

Stein | On differentiability properties of player convex generalized Nash equilibrium problems [...] |

Schwartz | Biased lottery versus all-pay auction contests: A revenue dominance theorem [...] |

Ferris | Stochastic variational inequalities and MOPEC [...] |

** Conic programming
** |

H 2036 | **Algorithms for matrix optimization problems** [...] |

Li | Sequential semismooth Newton method for nearest low-rank correlation matrix problem [...] |

Wang | On how to solve large scale matrix log-determinant optimization problems [...] |

Xia | Gradient methods for a general least squares problem [...] |

H 2038 | **Nonlinear semidefinite programs and copositive programs** [...] |

Kocvara | Introducing PENLAB, a Matlab code for nonlinear conic optimization [...] |

Dür | Remarks on copositive plus matrices and the copositive plus completion problem [...] |

Dickinson | Considering the complexity of complete positivity using the Ellipsoid method [...] |

** Constraint programming
** |

H 3003A | **Improved representations for constraint programming** [...] |

Pelleau | Octagonal domains for constraint programming [...] |

** Finance & economics
** |

H 3027 | **New developments in computational finance** [...] |

Coleman | On the use of automatic differentiation to efficiently determine first and second derivatives in financial applications [...] |

Fonseca | Robust value-at-risk with linear policies [...] |

Reisinger | The effect of the payoff on the penalty approximation of American options [...] |

** Game theory
** |

MA 043 | **Large games and networks: Control and approachability** [...] |

Malhame | Nash equilibria in radial communication networks via mean field game theory [...] |

Como | Stability analysis of transportation networks with multiscale driver decisions [...] |

Bauso | Time-averaged consensus and distributed approachability in large multi-agent networks [...] |

** Global optimization
** |

H 2053 | **Global optimization: Algorithms and applications** [...] |

Rebennack | Good linear approximations for MINLP Problems with tolerance guarantee [...] |

Prokopyev | Optimal design of the annual influenza vaccine with autonomous manufacturer [...] |

Zhupanska | A nonlinear semidefinite programming approach to design of materials [...] |

** Implementations & software
** |

H 1058 | **Optimization tools for R** [...] |

Friberg | The R-to-MOSEK optimization interface [...] |

Theußl | ROI - R Optimization Infrastructure package [...] |

Dirkse | GDXRRW: Exchanging data between GAMS and R [...] |

** Integer & mixed-integer programming
** |

H 2013 | **MILP formulations I** [...] |

Mclay | A mixed-integer programming model for enforcing priority list policies in Markov decision processes [...] |

de Araujo | Lagrange heuristic for a reformulated capacitated lot sizing problem in parallel machines [...] |

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

Williams | The general solution of a mixed integer programme [...] |

Gueye | Using distance variables for the quadratic assignment problem [...] |

MA 004 | **New methodologies for mixed-integer programming** [...] |

Vielma | Split cuts for convex nonlinear mixed integer programming [...] |

Bienstock | Strong formulations for convex functions over nonconvex sets [...] |

Moran | Strong dual for conic mixed-integer programs [...] |

MA 042 | **Computational integer programming** [...] |

Steffy | Improving the accuracy of linear programming solvers with iterative refinement [...] |

Wesselmann | Computational experiments with general-purpose cutting planes [...] |

Espinoza | Cutting and separation for semi-continuous variables [...] |

** Life sciences & healthcare
** |

H 2033 | **Evolution and phylogenetics** [...] |

Scornavacca | Constructing minimal phylogenetic networks from softwired clusters is fixed parameter tractable [...] |

Kelk | Cycle killer … {} qu'est-ce que c'est? On the comparative approximability of hybridization number and directed feedback vertex set [...] |

Fischer | When sets of species make an evolutionary tree unique [...] |

** Logistics, traffic, and transportation
** |

H 0106 | **Branch-and-price algorithms in transportation** [...] |

Voll | Branch-and-price-and-cut for railroad blocking plans [...] |

Seixas | Branch-and-price for a rich vehicle routing and scheduling problem [...] |

Bohlin | An extended formulation for allocating classification tracks in hump yards [...] |

H 0111 | **Advances in machine learning** [...] |

Grigas | Proximal subgradient and dual averaging for sequential decision-making and non-smooth optimization [...] |

Farias | Non-parametric approximate dynamic programming via the kernel method [...] |

Negahban | Noisy matrix decomposition via convex relaxation: Optimal rates in high dimensions [...] |

** Mixed-integer nonlinear programming
** |

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

Knudsen | Mixed integer optimization of the late-life performance of shale-gas wells [...] |

Guillén-Gosálbez | Solving mixed-integer linear-fractional programming problems via an exact MILP reformulation [...] |

Castro | Multiparametric disaggregation as a new paradigm for global optimization of mixed-integer polynomial programs [...] |

** Multi-objective optimization
** |

H 1029 | **Efficient set representations** [...] |

Stiglmayr | The multicriteria linear bottleneck assignment problem [...] |

Paquete | Concise representation of nondominated sets in discrete multicriteria optimization [...] |

Seipp | A polynomial time approach for the multiple objective minimum spanning tree problem [...] |

** Nonlinear programming
** |

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

Gorka | Parallel direction finding algorithm in method of feasible directions [...] |

Hungerford | Edge directions in polyhedral optimization [...] |

Zsolt | Pros and cons of first order methods for solving general nonlinear problems [...] |

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

Robinson | A primal-dual active-set method for convex QP [...] |

Leyffer | Large-scale nonlinear optimization solvers [...] |

Wong | Regularized quadratic programming methods for large-scale SQP [...] |

H 0112 | **Structures, complexities, and eigenvalues of tensor forms and polynomial functions** [...] |

Zhang | Cones of nonnegative quartic polynomial functions and their applications [...] |

Lim | 3-tensors as the boundary of tractability [...] |

Yang | Some properties of tensors’ eigenvalues and related optimization problem [...] |

** Nonsmooth optimization
** |

H 1012 | **Constrained variational inequalities: Approximation and numerical resolution** [...] |

Peypouquet | Lagrangian-penalization algorithm for constrained optimization and variational inequalities [...] |

Garcia Ramos | Representable monotone operators and limits of sequences of maximal monotone operators [...] |

Alvarez | A strictly feasible Bundle method for solving convex nondifferentiable minimization problems under second-order constraints [...] |

** Optimization in energy systems
** |

MA 549 | **Optimization in energy systems** [...] |

Nadarajah | Approximate linear programming relaxations for commodity storage real option management [...] |

Lohmann | Stochastic hydro-thermal scheduling with CVaR risk constraints in deregulated markets [...] |

Guan | A branch-and-cut algorithm for the Multi-stage Stochastic Unit Commitment Problem [...] |

MA 550 | **Network operation under failures and losses** [...] |

Chen | Survivability-constrained generation unit commitment with post-contingency corrective recourse [...] |

Canto dos Santos | New genetic algorithms for contingencies selection in electric power systems [...] |

Evaldt | Optimal allocation of equipment for monitoring and identification of commercial losses in distribution networks [...] |

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

MA 415 | **Iterative solution of PDE constrained optimization and subproblems** [...] |

Zhlobich | Multilevel quasiseparable matrices in PDE-constrained optimization [...] |

Kriwet | Covariance matrix computation for parameter estimation in nonlinear models solved by iterative linear algebra methods [...] |

Lehmann | Optimal sequencing of primal, adjoint and design steps. [...] |

** Robust optimization
** |

H 3503 | **Robust nonlinear optimization** [...] |

Mevissen | Distributionally robust optimization for polynomial optimization problems [...] |

Pirnay | An algorithm for robust optimization of nonlinear dynamic systems [...] |

Fleischman | On the trade-off between robustness and value [...] |

** Sparse optimization & compressed sensing
** |

H 1028 | **Sparse optimization and generalized sparsity models** [...] |

Saab | Recovering compressively sampled signals using partial support information [...] |

Candes | PhaseLift: Exact phase retrieval via convex programming [...] |

Kutyniok | Clustered sparsity [...] |

** Stochastic optimization
** |

MA 141 | **Applications in natural resources** [...] |

Danzan | Regional economical mathematical models considering ecological factors [...] |

Lenz | Optimization of water network operation under uncertainties [...] |

Piazza | The optimal harvesting problem under price uncertainty [...] |

MA 144 | **Production, inventory and project management** [...] |

Huang | Optimal aggregate production planning with fuzzy data [...] |

Randa | Static-dynamic uncertainty strategy for a single-item stochastic inventory control problem [...] |

Hasuike | Risk control approach to critical path method in mathematical programming under uncertainty [...] |

MA 376 | **Stochastic mixed-integer programming** [...] |

Evers | The orienteering problem under uncertainty: Robust optimization and stochastic programming compared [...] |

Romeijnders | On the performance of a class of convex approximations for integer recourse models [...] |

Kucukyavuz | Decomposition algorithms with Gomory cuts for two-stage stochastic integer programs [...] |

** Telecommunications & networks
** |

H 3002 | **Wireless networks** [...] |

Astrakov | The full efficient monitoring of stripe with external deployment sensors [...] |

Nigam | A Lagrangian heuristic for delay constrained relay node placement problem in wireless sensor networks [...] |

Berger | Constrained resource assignments: Fast algorithms and applications in wireless networks [...] |

** Variational analysis
** |

H 2035 | **Eigenvalue and semi-infinite optimization** [...] |

Grundel | Variational analysis of the spectral abscissa for defective and derogatory matrices [...] |

Tchemisova | On a constructive approach to optimality conditions for convex SIP problems with polyhedral index sets [...] |

Eaton | On the subdifferential regularity of functions of roots of polynomials [...] |

H 2051 | **Variational analysis and economic equilibrium** [...] |

Jourani | A characterization of the free disposal condition for nonconvex economies on infinite-dimensional commodity spaces [...] |

Bonnisseau | On the rank of payoff matrices with long-term assets [...] |

Jofré | The robust stability of every equilibrium in economic models of exchange even under relaxed standard conditions [...] |