** Approximation & online algorithms
** |

H 3010 | **Approximation in algorithmic game theory** [...] |

** Combinatorial optimization
** |

H 3004 | **Generalizing shortest paths, cycles, and Steiner trees** [...] |

H 3005 | **Submodularity and covering** [...] |

H 3008 | **LP based approximation algorithms for location and routing** [...] |

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

H 3013 | **Trees and words** [...] |

H 3021 | **Data structures and algorithms for VLSI routing** [...] |

** Complementarity & variational inequalities
** |

MA 041 | **Complementarity properties of linear transformations on Euclidean Jordan algebras** [...] |

MA 313 | **Matrix classes for linear complementarity problems** [...] |

** Conic programming
** |

H 2036 | **Smoothing methods for symmetric cone complementarity problems** [...] |

H 2038 | **New advances in conic programming** [...] |

** Constraint programming
** |

H 3003A | **Constraint programming for routing and scheduling** [...] |

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

H 3503 | **Derivative-free optimization and constraints** [...] |

** Finance & economics
** |

H 3027 | **Portfolio optimization** [...] |

** Game theory
** |

MA 043 | **Game-theoretic models in operations** [...] |

** Global optimization
** |

H 2053 | **Convex optimization approaches to polynomial optimization problems** [...] |

** Implementations & software
** |

H 1058 | **MILP software II** [...] |

** Integer & mixed-integer programming
** |

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

H 2032 | **Trends in mixed integer programming II** [...] |

MA 042 | **Non-standard optimization methods** [...] |

** Life sciences & healthcare
** |

H 2033 | **Bioinformatics and combinatorial optimization I** [...] |

** Logistics, traffic, and transportation
** |

H 0106 | **Routing with time windows** [...] |

H 0111 | **Green maritime transport logistics** [...] |

** Mixed-integer nonlinear programming
** |

MA 005 | **Efficient solvers for mixed integer nonlinear optimization problems** [...] |

** Multi-objective optimization
** |

H 1029 | **Multiobjective optimization II** [...] |

** Nonlinear programming
** |

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

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

H 0112 | **Real-time optimization I** [...] |

** Nonsmooth optimization
** |

H 1012 | **Nonsmooth optimization in imaging sciences II** [...] |

** Optimization in energy systems
** |

MA 549 | **Multi-stage stochastic programming models for electricity systems** [...] |

MA 550 | **Nonlinear and combinatorial aspects in energy optimization** [...] |

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

MA 415 | **Adaptive methods in PDE constrained optimization** [...] |

** Robust optimization
** |

MA 004 | **Dynamic optimization and its applications** [...] |

** Sparse optimization & compressed sensing
** |

H 1028 | **Machine learning algorithms and implementations** [...] |

** Stochastic optimization
** |

MA 141 | **Methods of risk-averse optimization** [...] |

MA 144 | **Recent advances in risk representation** [...] |

MA 376 | **Multistage stochastic mixed 0-1 optimization: Algorithms and applications** [...] |

** Telecommunications & networks
** |

H 3002 | **Flow and path problems** [...] |

** Variational analysis
** |

H 2035 | **Nonsmooth analysis via piecewise-linearization** [...] |

H 2051 | **Variational inequalities and optimization problems on Riemannian manifolds** [...] |