Parallel Sessions Day by Day

Please login, if you want to restrict your search of talks to your preferred clusters. Edit your preference list on the Cluster List

Sorted by cluster |  room
including talk |  session Mon | Tue | Wed | Thu | Fri
10:30 | 13:15 | 15:15 | any

Tuesday, 15:15 - 16:45 h


Approximation & online algorithms
H 3010Travelling salesman problem II [...]
Mömke Approximationg graphic TSP by matchings [...]
Mucha 13/9-approximation for graphic TSP [...]
Singh A randomized rounding approach to the traveling salesman problem [...]
Combinatorial optimization
H 3004Extended formulations in discrete optimization I [...]
Pokutta On linear programming formulations of the TSP polytope [...]
Rothvoss Some 0/1 polytopes need exponential size extended formulations [...]
Grappe Extended formulations, non-negative factorizations, and randomized communication protocols [...]
H 3005Matroid parity [...]
Cheung Algebraic algorithms for linear matroid parity problems [...]
Iwata Weighted linear matroid parity [...]
Pap Weighted linear matroid parity - A primal-dual approach [...]
H 3008Combinatorics and geometry of linear optimization II [...]
Pataki Bad semidefinite programs: They all look the same [...]
Stephen The width of 4-prismatoids [...]
Bremner Minimum norm points on the boundary of convex polytopes [...]
H 3012LP relaxations [...]
Godinho On a time-dependent formulation for the travelling salesman problem [...]
Hochbaum Flow-based algorithms that solve clustering problems related to graph expander, normalized cut and conductance better than the spectral method [...]
Kuo On the mixed set covering, partitioning and packing problem [...]
H 3013Combinatorial optimization and equilibria for flows over time [...]
Fleischer Competitive strategies for routing flow over time [...]
Koch Continuous and discrete flows over time [...]
Larre Existence and uniqueness of equilibria for flows over time [...]
H 3021New insights for old problems [...]
Stauffer A simple and fast 2-approximation algorithm for the one-warehouse multi-retailer problem [...]
Segev An approximate dynamic-programming approach to the joint replenishment problem [...]
Schulz The joint replenishment problem and the problem of clustering frequency-constrained maintenance jobs are integer-factorization hard [...]
Complementarity & variational inequalities
MA 041Differential variational inequalities [...]
Hintermüller A bundle-free implicit programming approach for MPECs in function space via smoothing [...]
Farshbaf-Shaker Optimal control of vector-valued elastic Allen-Cahn variational inequalities [...]
Wang Large-scale differential variational inequalities for phase-field modeling [...]
MA 313MPECs in function space II [...]
Migorski An optimal control problem for a system of elliptic hemivariational inequalities [...]
De los Reyes Optimality conditions for control problems of variational inequalities of the second kind [...]
Wachsmuth Optimal control of quasistatic plasticity [...]
Conic programming
H 2036First-derivative and interior methods in convex optimization [...]
Anjos Convergence and polynomiality of a primal-dual interior-point algorithm for linear programming with selective addition of inequalities [...]
Devolder Intermediate gradient methods for smooth convex optimization problems with inexact oracle [...]
Herskovits A feasible direction interior point algorithm for nonlinear convex semidefinite programming [...]
H 2038Conic and convex programming in statistics and signal processing I [...]
Andersen Multifrontal barrier computations for sparse matrix cones [...]
Mishra Fixed-rank matrix factorizations and the design of invariant optimization algorithms [...]
Chandrasekaran Computational and sample tradeoffs via convex relaxation [...]
Constraint programming
H 3003AConstraint programming methodology [...]
Walsh Breaking variable and value symmetry in constraint satisfaction and optimisation problems [...]
Schnell The impact of the predefined search space on recent exact algorithms for the RCPSP [...]
Gokgur Mathematical modelling and constraint programming approaches for operation assignment and tool loading problems in flexible manufacturing systems [...]
Derivative-free & simulation-based optimization
H 3503Novel approaches in derivative-free optimization [...]
Nesterov Random gradient-free minimization of convex functions [...]
Bandeira On sparse Hessian recovery and trust-region methods based on probabilistic models [...]
Rakhlin Regret minimization with zeroth order information [...]
Finance & economics
H 3027Applications and algorithms [...]
Joannopoulos Feeding cost optimization of several diet formulations and environmental impact in the swine industry [...]
Satoshi 2-approximation algorithms for the winner determination problem in VCG based single-item multi-unit auctions [...]
Vakulina Project risks analysis using approach of fuzzy sets theory [...]
Game theory
MA 043New LCP-based market equilibrium algorithms [...]
Garg A complementary pivot algorithm for markets under separable piecewise-linear concave utilities [...]
Mehta LCP and Lemke-type algorithm for markets with production [...]
Ye A FPTAS for computing a symmetric Leontief competitive economy equilibrium [...]
Global optimization
H 2053From quadratic through factorable to black-box global optimization [...]
Dumas A new global optimization method based on a sparse grid metamodel [...]
Floudas Globally optimizing mixed-integer quadratically-constrained quadratic programs (MIQCQP) [...]
Tsoukalas Extension of McCormick's composition to multi-variate outer functions [...]
Implementations & software
H 1058NLP and MINLP software [...]
Schittkowski MISQP: A TR-SQP algorithm for the efficient solution of non-convex, non-relaxable mixed-integer nonlinear programming problems [...]
Vanderbei Fast fourier optimization [...]
Integer & mixed-integer programming
H 2013Advances in mixed integer programming [...]
Berthold Measuring the impact of primal heuristics [...]
Padberg The rank of (mixed-) integer polyhedra [...]
Serrano Some computational experiments with multi-row cuts. [...]
H 2032Trends in mixed integer programming V [...]
Parriani An analysis of natural approaches for solving multicommodity-flow problems [...]
Newman Practical guidelines for solving difficult linear and mixed integer programs [...]
H 2033Location problems [...]
Marín Discrete ordered non-linear median problem with induced order [...]
Wilhelm The stochastic healthcare facility configuration problem [...]
Logistics, traffic, and transportation
H 0106Exact approaches to routing problems [...]
Deineko A framework for vehicle routing [...]
Cardonha A fast solution method applied to the vehicle positioning problem and its multi-periodic, online, and robust extension [...]
Ropke Exact and heuristic solution methods for the generalized asymmetric vehicle routing problem and the capacitated arc routing problem [...]
H 0111Approximation algorithms for supply chain management and logistics optimization models [...]
Carnes A primal-dual approximation algorithm for air ambulance routing and deployment [...]
Romero Allocating subsidies to minimize a commodity's market price - a network design approach [...]
Elmachtoub Supply chain management with online customer selection [...]
Mixed-integer nonlinear programming
MA 005Convex relaxations for nonconvex optimization problems [...]
Anstreicher Second-order-cone constraints for extended trust-region subproblems [...]
Linderoth Solving mixed integer polynomial optimization problems with MINOTAUR [...]
Lee Global optimization of indefinite quadratics [...]
Multi-objective optimization
H 1029Applications of multiobjective optimization [...]
Tuncer Şakar Effects of multiple criteria and different planning horizons on portfolio optimization [...]
Alvarez-Vazquez Air pollution and industrial plant location: A multi-objective optimization approach [...]
Zabudsky Optimal location of rectangles on parallel lines [...]
Nonlinear programming
H 0107Interior-point methods [...]
Liao A study of the dual affine scaling continuous trajectories for linear programming [...]
Kato An interior point method with a primal-dual quadratic barrier penalty function for nonlinear semidefinite programming [...]
Hassan The l1- Penalty Interior Point Method [...]
H 0110Recent advances in nonlinear optimization [...]
Gould SQP Filter methods without a restoration phase [...]
Gill Regularization and convexification for SQP methods [...]
Waechter A hot-started NLP solver [...]
H 0112Real-time optimization III [...]
Kögel On real-time optimization for model predictive control using multiplier methods and Nesterov’s gradient method [...]
Pannocchia On the convergence of numerical solutions to the continuous-time constrained LQR problem [...]
Kerrigan Breaking away from double-precision floating-point in interior point solvers [...]
Nonsmooth optimization
H 1012Large-scale structured optimization [...]
Nemirovski Randomized first-order algorithms for bilinear saddle point problems and their applications to l1 minimization [...]
Shpirko Primal-dual subgradient method for huge-scale conic optimization problems and its applications in structural design [...]
Optimization in energy systems
MA 549Optimization for power grids [...]
Raghunathan Global optimization of power flow problems [...]
Harnett Robust DCOPF [...]
Chiang Solving SCOPF problems by a new structure exploiting interior point method [...]
MA 550Mathematical optimization for mid-term operation planning in gas networks [...]
Geißler A new approach for solving MINLPs applied to gas network optimization [...]
Willert A high accuracy optimization model for gas networks [...]
Humpola Topology optimization for nonlinear network flows [...]
PDE-constrained optimization & multi-level/multi-grid methods
MA 415Optimization applications in industry II [...]
Yousept PDE-constrained optimization involving eddy current equations [...]
Grepl A certified reduced basis approach for parametrized linear-quadratic optimal control problems [...]
Ulbrich Multilevel optimization based on adaptive discretizations and reduced order models for engineering applications [...]
Robust optimization
MA 004Applications of robust optimization II [...]
O'Hair Adaptive, dynamic and robust optimization to learn human preferences [...]
Sun Adaptive robust optimization for the security constrained unit commitment problem [...]
Kallus The power of optimization over randomization in designing controlled trials [...]
MA 042Theory of robust optimization [...]
Den Hertog Deriving robust counterparts of nonlinear uncertain inequalities [...]
Gorissen Tractable robust counterparts of linear conic optimization problems via their duals [...]
Pferschy On the robust knapsack problem [...]
Sparse optimization & compressed sensing
H 1028Algorithms for sparse optimization I [...]
Tillmann Heuristic optimality check and computational solver comparison for basis pursuit [...]
Zikrin Sparse optimization techniques for solving multilinear least-squares problems with application to design of filter networks [...]
Demenkov Real-time linear inverse problem and control allocation in technical systems [...]
Stochastic optimization
MA 141Advances in stochastic programming [...]
Georghiou A stochastic capacity expansion model for the UK energy system [...]
Parpas Dimensionality reduction and a maximum principle for multiscale stochastic processes [...]
Kuhn Polyhedrality in distributionally robust optimization [...]
MA 144Nonlinear stochastic optimization [...]
Klamroth Modeling uncertainties in location-allocation problems: A stochastic programming approach [...]
Mijangos An algorithm for nonlinearly-constrained nonlinear two-stage stochastic problems [...]
Poggi On a class of stochastic programs with endogenous uncertainty: Algorithm and applications [...]
MA 376Approximation algorithms for stochastic combinatorial optimization [...]
Goertz Stochastic vehicle routing with recourse [...]
Ravi Approximation algorithms for correlated knapsacks and non-martingale bandits [...]
Spencer Fragmenting and vaccinating graphs over time and subject to uncertainty: Developing techniques for wildfire and invasive species containment [...]
Telecommunications & networks
H 3002Communication network design [...]
Ruiz Multi-constructive meta-heuristic for the metro areas design problem in hierarchical optical transport networks [...]
Pulaj Models for network design under varied demand structures [...]
Lee A nonlinear mixed integer programming problem in designing local access networks with QoS constraints. [...]
Variational analysis
H 2035Control and optimization of impulsive systems II [...]
Arutyunov The R.V. Gamkrelidze's maximum principle for state constrained optimal control problem: Revisited [...]
Goncharova Impulsive systems with mixed constraints [...]
Pfeiffer Sensitivity analysis for relaxed optimal control problems with final-state constraints [...]
H 2051Recent advances on linear complementarity problems [...]
Hiriart-Urruty A variational approach of the rank function [...]
Ramírez Existence and stability results based on asymptotic analysis for semidefinite linear complementarity problems [...]


Sorted by cluster |  Room Mon | Tue | Wed | Thu | Fri
10:30 | 13:15 | 15:15 | any
  There are three major facts that should be watched out for in all payday loans in the United States. Since its introduction in the market buying Order Cialis can be exclusively in pharmacy chains with a prescription from a doctor. I agree that this is very inconvenient and takes a lot of time and effort.