** Special sessions
** |

MA 041 | **Klaus Tschira workshop** [...] |

| Klaus Tschira workshop Übungen, Raum MA 241, 17-20 Uhr [...] |

Hiller | Geometrie und Optimierung für den Handlungsreisenden [...] |

Kirches | Schöne optimierte neue Welt? [...] |

** Approximation & online algorithms
** |

H 3010 | **Online algorithms** [...] |

Madry | A polylogarithmic-competitive algorithm for the *k*-server problem [...] |

Bhaskar | Online mixed packing and covering [...] |

Mirrokni | Simultaneous adversarial and stochastic approximations for budgeted allocation problems [...] |

** Combinatorial optimization
** |

H 3004 | **Optimization methods for geometric problems** [...] |

de Souza | Towards solving to optimality the art gallery with point-guards problem [...] |

Kröller | Practical solutions and bounds for art gallery problems [...] |

Halperin | Multi-objective path optimization in motion planning: From the particular to the general [...] |

H 3005 | **Recent advances in matching algorithms** [...] |

Gupta | Fully dynamic maximal matching in *O(**log* n) update time [...] |

Huang | Efficient algorithms for maximum weight matchings in general graphs with small edge weights [...] |

Mahdian | Online bipartite matching with random arrivals: An approach based on strongly factor-revealing LPs [...] |

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

Kobayashi | An algorithm for finding a maximum *t*-matching excluding complete partite subgraphs [...] |

Tanigawa | Rooted-tree decompositions with matroid constraints and the infinitesimal rigidity of frameworks with boundaries [...] |

Nagano | Size-constrained submodular minimization through minimum norm base [...] |

H 3012 | **Arborescences** [...] |

Bernáth | Covering minimum cost arborescences [...] |

Leston-Rey | Packing entering sets in kernel systems [...] |

Call | A polyhedral analysis of a unique shortest path routing polytope [...] |

H 3013 | **Scheduling and network flows over time** [...] |

Groß | Approximating earliest arrival flows in arbitrary networks [...] |

Marchetti-Spaccamela | Universal sequencing on an unreliable machine [...] |

Kappmeier | Flows over time with negative transit times and arc release dates [...] |

** Complementarity & variational inequalities
** |

MA 313 | **Algorithms for complementarity and related problems I** [...] |

Pogosyan | Semismooth Newton-type methods for lifted mathematical programs with complementarity constraints [...] |

Uskov | Global convergence of augmented Lagrangian methods applied to optimization problems with degenerate constraints, including problems with complementarity constraints [...] |

Morris | Efficient computation of a canonical form for a generalized P-matrix [...] |

** Conic programming
** |

H 2036 | **Conic optimization and signal processing applications** [...] |

Ji | Approximating a KKT point of Schatten p-quasi-norm minimization in polynomial time, with applications to sensor network localization [...] |

Ma | Semidefinite relaxation in wireless communications: Forefront developments, advances and challenges [...] |

Yang | Multi-portfolio optimization: A variational inequality approach [...] |

H 2038 | **Recent developments of theory and applications in conic optimization I** [...] |

Gowda | On the nonhomogeneity and the bilinearity rank of a completely positive cone [...] |

Muramatsu | A perturbed sums of squares theorem for polynomial optimization and its applications [...] |

Alizadeh | Some geometric applications of abstract algebraic sum-of-squares cones [...] |

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

H 3003A | **Recent progress in direct search methods** [...] |

Le Digabel | The mesh adaptive direct search algorithm with reduced number of directions [...] |

Martínez | Inexact restoration method for derivative-free optimization with smooth constraints [...] |

Garmanjani | Smoothing and worst case complexity for direct-search methods in non-smooth optimization [...] |

** Finance & economics
** |

H 3021 | **Modern portfolio optimization** [...] |

Özekici | Portfolio selection with hyperexponential utility functions [...] |

Hendrix | On finding optimal portfolios with risky assets [...] |

H 3027 | **Applications in finance** [...] |

Ekblom | Optimal hedging of foreign exchange risk in uncertain cash flows using stochastic programming [...] |

Barkhagen | An optimization based method for arbitrage-free estimation of the implied risk neutral density surface [...] |

Mayer | Portfolio optimization with objective functions from cumulative prospect theory [...] |

** Game theory
** |

MA 005 | **New models and solution concepts I** [...] |

Wu | A new solution concept for cooperative games [...] |

Granot | Subgame perfect consistent stability [...] |

MA 043 | **Software piracy and mastermind** [...] |

Perlman | Software piracy prevention and price determination [...] |

Winzen | Playing mastermind with many colors [...] |

** Global optimization
** |

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

Csendes | Symbolic simplification of nonlinear optimization problems [...] |

Nguyen | The interior exterior approach for linear programming problem [...] |

Nguyen | Solving standard problem (StQP) [...] |

** Implementations & software
** |

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

Rutquist | Trajectory optimization with TOMLAB/PROPT [...] |

Valente | Optimisation under uncertainty: Software tools for modelling and solver support [...] |

Beraudier | Modeling best practices: How to write good optimization models efficiently thanks to IBM ILOG CPLEX Optimization Studio's Integrated Development Environment (IDE) and its debugging support [...] |

** Integer & mixed-integer programming
** |

H 2013 | **Topology, clustering and separation** [...] |

Fampa | MILP formulation for the software clustering problem [...] |

Guillén | Natural languages with the morphosyntactic distance as a topological space [...] |

Andruski-Guimarães | Comparison of techniques based on linear programming to detect separation [...] |

H 2032 | **Branch-and-price IV: Primal heuristics** [...] |

Puchert | Large neighborhood search and diving heuristics in column generation algorithms [...] |

Vanderbeck | Primal heuristics for branch-and-price [...] |

Bastubbe | A branch-and-price algorithm for rearranging a matrix into doubly bordered block-diagonal form [...] |

H 2033 | **Mixed-integer linear and semidefinite programs** [...] |

Mars | Approaches to solve mixed integer semidefinite programs [...] |

Hoang | Steiner tree packing revisited [...] |

Miltenberger | Advances in linear programming [...] |

** Life sciences & healthcare
** |

MA 376 | **Mathematical modeling of disease** [...] |

Savic | Mathematical modeling of amygdalin isolation from plum kernel using response surface methodology [...] |

Ouncharoen | Stability of HIV aphaeresis model [...] |

** Logistics, traffic, and transportation
** |

H 0106 | **Logistics and transportation** [...] |

Korula | Prize-collecting Steiner network problems on planar graphs [...] |

Bateni | PTAS for planar multiway cut [...] |

Asadpour | Rounding by sampling and an *O(**log* n / *log* *log* n) approximation algorithm for ATSP [...] |

MA 042 | **Real-world applications** [...] |

Holmberg | Planning and routing in networks: Urban snow removal [...] |

Branchini | Fleet deployment optimization model for tramp and liner shipping [...] |

** Mixed-integer nonlinear programming
** |

MA 001 | **Mixed-integer nonlinear programming** [...] |

Onn | Integer programming in polynomial time via Graver bases [...] |

Sotirov | SDP relaxations for the graph partition problem [...] |

Hemmecke | N-fold integer programming in cubic time [...] |

** Multi-objective optimization
** |

H 1029 | **Preference structures in multi-objective optimization** [...] |

Eichfelder | A procedure for solving vector optimization problems with a variable ordering structure [...] |

Soleimani | Approximate solutions of vector optimization with variable order structure [...] |

Kasimbeyli | Characterization of properly nondominated elements in vector optimization with variable ordering structures [...] |

** Nonlinear programming
** |

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

Fan | Accelerating the modified Levenberg-Marquardt method [...] |

Wang | Optimizing inversion methods for seismic imaging [...] |

Bosse | Limited memory updating and quadratic overestimation for NLOP [...] |

H 0110 | **Polynomial optimization and semidefinite programming** [...] |

Zhi | Computing real solutions of polynomial systems via low-rank moment matrix completion [...] |

Riener | Symmetry in polynomial optimization [...] |

Schweighofer | The sums of squares dual of a semidefinite program [...] |

H 0112 | **Nonlinear multilevel and domain decomposition methods in optimization** [...] |

Dostal | Optimal massively parallel algorithms for large QP/QPQC problems arising in mechanics [...] |

Turner | Applications of domain decomposition to topology optimization [...] |

Krause | Inherently nonlinear decomposition and multilevel strategies for non-convex minimization [...] |

** Nonsmooth optimization
** |

H 1012 | **Algorithms for nonsmooth optimization** [...] |

Mifflin | A first step in designing a VU-algorithm for nonconvex minimization [...] |

Oliveira | Exploring accuracy and geometry in level bundle methods [...] |

Ouorou | Specialized proximal Chebychev center cutting plane algorithm for convex additive functions [...] |

** Optimization in energy systems
** |

MA 549 | **Equilibrium models for electricity markets** [...] |

Holmberg | Supply function equilibria in networks with transport constraints [...] |

Anderson | When do supply function equilibria exist? [...] |

Philpott | Competitive equilibrium and risk aversion in hydro-dominated electricity markets [...] |

MA 550 | **Gas transport in networks** [...] |

Schmidt | An extended interior point method for nonsmooth nonlinear optimization in gas networks [...] |

Joormann | Analyzing infeasibility in natural gas networks [...] |

Gollmer | Stationary gas transport - Structure of the problem and a solution approach [...] |

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

H 0111 | **Adjoint-based methods and algorithmic differentiation in large scale optimization** [...] |

Strogies | A time-labeling approach for open pit mine planning [...] |

Özkaya | Automatic differentiation of an unsteady RANS solver for optimal active flow control [...] |

Schmidt | Large scale shape optimization [...] |

MA 415 | **Variational methods in image processing and compressed sensing** [...] |

Dong | A convex variational model for restoring blurred images with multiplicative noise [...] |

Jiang | Surveillance video processing using compressive sensing [...] |

Wu | A nonconvex *TV*^{q} model in image restoration [...] |

** Robust optimization
** |

MA 004 | **Regret with robustness: Models, algorithms and applications** [...] |

Shi | A probabilistic model for minmax regret combinatorial optimization [...] |

Uichanco | Regret optimization for stochastic inventory models with spread information [...] |

** Sparse optimization & compressed sensing
** |

H 1028 | **Variational signal processing -- algorithms and applications** [...] |

Zhang | On variational image decomposition model for blurred images with missing pixel values [...] |

Yang | Convergence of a class of stationary iterative methods for saddle point problems [...] |

** Stochastic optimization
** |

MA 141 | **Measures of uncertainty** [...] |

Maggioni | Measures of information in multistage stochastic programming [...] |

Garatti | The risk of empirical costs in randomized min-max stochastic optimization [...] |

Gaivoronski | Stochastic bilevel optimization problems with applications to telecom [...] |

MA 144 | **Chance constrained stochastic optimization** [...] |

Song | A branch-and-cut algorithm for the chance-constrained knapsack problem [...] |

Birman | Overall aircraft design based on chance-constrained programming [...] |

Cheng | Stochastic linear programming with joint chance constraints [...] |

** Telecommunications & networks
** |

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

Nguyen | A direct algorithm for detecting negative cost cycles in undirected graphs [...] |

Benhamiche | On the optical multi-band network design problem [...] |

Taktak | Models and algorithms for the survivable multilayer network design problem [...] |

H 3503 | **Robust communication networks** [...] |

Claßen | A branch-and-price approach for the robust wireless network planning [...] |

Karch | Fiber replacement scheduling [...] |

** Variational analysis
** |

H 2035 | **Set-valued convex and quasiconvex duality** [...] |

Schrage | Dini derivatives for vector- and set-valued functions [...] |

Hamel | Lagrange duality in set optimization [...] |

Drapeau | Complete duality for convex and quasiconvex set-valued functions [...] |

H 2051 | **Semi-continuous programming** [...] |

Ribeiro | Fenchel-Moreau conjugation for lower semi-continuous functions [...] |

Raupp | A duality scheme for semi-continuous programming [...] |

Sosa | Separation theorems for closed sets [...] |