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, 10:30 - 12:00 h


Approximation & online algorithms
H 3010Approximation in algorithmic game theory [...]
Georgiou Black-box reductions for cost-sharing mechanism design [...]
Vöcking A universally-truthful approximation scheme for multi-unit auctions [...]
Chakrabarty Matching markets with ordinal preferences [...]
Combinatorial optimization
H 3004Generalizing shortest paths, cycles, and Steiner trees [...]
Gualandi Resource constrained shortest paths with a super additive objective function [...]
Dan Finding the shortest cycle in directed graphs under some constraints on passing vertices and paths [...]
Karbstein Approximation and min-max results for the Steiner connectivity problem [...]
H 3005Submodularity and covering [...]
Sviridenko New and improved bounds for the minimum set cover problem [...]
Krause Adaptive submodularity: Theory and applications in active learning and stochastic optimization [...]
Zenklusen Matroids and integrality gaps for hypergraphic Steiner tree relaxations [...]
H 3008LP based approximation algorithms for location and routing [...]
Byrka Fault-tolerant facility location: A randomized dependent LP-rounding algorithm [...]
Blasiak Improved approximation algorithms for the minimum latency problem via prize-collecting paths [...]
Friggstad A logarithmic approximation for the directed latency problem [...]
H 3012Scheduling III [...]
Poppenborg Modeling the resource-constrained project scheduling problem with resource transfers using a graph approach. [...]
Bosio Mailroom production planning [...]
H 3013Trees and words [...]
Hochstättler Some heuristics for the binary paint shop problem and their expected number of colour changes [...]
Krzywkowski An algorithm listing all minimal dominating sets of a tree [...]
Matsui An enumeration algorithm for the optimal cost vertex-colorings for trees [...]
H 3021Data structures and algorithms for VLSI routing [...]
Müller Multi-flows and generalizations in VLSI routing [...]
Schulte Efficient algorithms and data structures in VLSI detailed routing [...]
Gester New challenges in chip design driven by technology scaling [...]
Complementarity & variational inequalities
MA 041Complementarity properties of linear transformations on Euclidean Jordan algebras [...]
Irulappasamy P and semimonotonicity properties of linear transformations on Euclidean Jordan algebras [...]
Tao The completely-Q property for linear transformations on Euclidean Jordan algebras [...]
Sznajder Complementarity properties of linear transformations on product spaces via Schur complements [...]
MA 313Matrix classes for linear complementarity problems [...]
Munson Preprocessing with composite matrices [...]
Cottle Lemke's algorithms and matrix classes for the linear complementarity problem [...]
Uchida Think co(mpletely)positive! Algebraic properties of matrices belonging to the copositive or related cones [...]
Conic programming
H 2036Smoothing methods for symmetric cone complementarity problems [...]
Cheng A smoothing method for symmetric cone complementarity problems [...]
Fukuda Differentiable exact penalty functions for nonlinear second-order cone programs [...]
Hayashi A smoothing SQP method for mathematical programs with second-order cone complementarity constraints [...]
H 2038New advances in conic programming [...]
Sponsel On standard quadratic optimization problems [...]
Dobre Infinite dimensional semidefinite programming [...]
Vera Exploiting symmetry in copositive programs [...]
Constraint programming
H 3003AConstraint programming for routing and scheduling [...]
Fages Solving the traveling salesman problem with constraint programming [...]
Malapert Scheduling a batch processing machine with constraints [...]
Rousseau Formal language for retail store workforce scheduling [...]
Derivative-free & simulation-based optimization
H 3503Derivative-free optimization and constraints [...]
Fasano An exact penalty method for constrained Lipschitz optimization [...]
Kofler Derivative-free optimization with equality constraints using data analysis [...]
Powell On derivative-free optimization with linear constraints [...]
Finance & economics
H 3027Portfolio optimization [...]
Ortobelli Lozza On the impact of some distributional factors in large scale portfolio problems [...]
Gotoh Robust portfolio techniques for coherent risk minimization [...]
Shioda Factor alignment problem in quantitative portfolio management [...]
Game theory
MA 043Game-theoretic models in operations [...]
Lobel Intertemporal price discrimination: Structure and computation of optimal policies [...]
Nazerzadeh Buy-it-now or take-a-chance: A mechanism for real-time price discrimination [...]
Perakis Markdown optimization for a fashion e-tailer: The impact of returning customers [...]
Global optimization
H 2053Convex optimization approaches to polynomial optimization problems [...]
Lambert Convex reformulations of integer quadratically constrained problems [...]
Rendl Active set methods for convex quadratic optimization with simple bounds [...]
Implementations & software
H 1058MILP software II [...]
Tieves Creating synergies between MIP-solvers [...]
Joswig polymake for integer linear programming [...]
Gardi LocalSolver: A mathematical programming solver based on local search [...]
Integer & mixed-integer programming
H 2013MILP formulations III [...]
Torres Optimizing the Ecuadorian football league third division. [...]
Hotta Enumeration and characterization of the electoral districting for the decision support [...]
Önnheim The opportunistic replacement problem: Model, theory and numerics [...]
H 2032Trends in mixed integer programming II [...]
Angulo Semi-continuous network flow problems [...]
Salvagnin Randomness and tree search [...]
Smriglio Interdiction branching [...]
MA 042Non-standard optimization methods [...]
Polyak Nonlinear equilibrium for optimal resource allocation [...]
Egbers Some remarks on the LP-Newton method [...]
Life sciences & healthcare
H 2033Bioinformatics and combinatorial optimization I [...]
Voller An optimal solution to the generalized distance geometry problem [...]
Mucherino Re-ordering protein side chains for the discretization of MDGPs [...]
Gebser Repair and prediction (under inconsistency) in large biological networks with answer set programming [...]
Logistics, traffic, and transportation
H 0106Routing with time windows [...]
Otero A hybrid evolutionary approach for solving the vehicle routing problem with time windows (VRPTW) [...]
Montanher An integer programming model for the oil transference in refineries under time window constraints [...]
Stursberg Vehicle routing with flexible load carriers [...]
H 0111Green maritime transport logistics [...]
Psaraftis Speed optimization in a ship pickup and delivery problem: balancing economic and environmental performance [...]
Lindstad Scheduling and environmental routing of maritime vessels in a multiobjective environment [...]
Schinas The cost of SOx limits to marine operators: Results from exploring marine fuel prices [...]
Mixed-integer nonlinear programming
MA 005Efficient solvers for mixed integer nonlinear optimization problems [...]
Vigerske Solving MINLPs with SCIP [...]
Dong On box constrained quadratic programming with binary indicators [...]
Belotti Separation of valid inequalities for multilinear functions [...]
Multi-objective optimization
H 1029Multiobjective optimization II [...]
Stidsen A branch & cut algorithm for bi-objective TSP [...]
Karakaya Decision support for multi-attribute multi-item reverse auctions [...]
Nasim Non-radial models to define the preference measure for convex cone-based strict partial order [...]
Nonlinear programming
H 0107Methods for nonlinear optimization IV [...]
Tannier Block diagonal preconditioners using spectral information for saddle-point systems [...]
Dürr Continuous-time saddle point algorithms with applications in control [...]
H 0110Nonlinear optimization IV [...]
Fowkes Global optimization of Lipschitz continuous functions [...]
Fletcher On trust regions and projections for an SLCP algorithm for NLP [...]
Erway Quasi-Newton methods for solving the trust-region subproblem [...]
H 0112Real-time optimization I [...]
Ferreau The ACADO code generation tool for high-speed model predictive control and moving horizon estimation [...]
Frasch Fast mixed-level iteration schemes for nonlinear model predictive control on multicore architectures [...]
Diehl Real-time optimization of large distributed systems [...]
Nonsmooth optimization
H 1012Nonsmooth optimization in imaging sciences II [...]
goldman Continuous primal-dual methods for image processing [...]
Helou Incremental subgradients for constrained convex optimization: A unified framework and new methods [...]
Fehrenbach Stripes removal in images, applications in microscopy [...]
Optimization in energy systems
MA 549Multi-stage stochastic programming models for electricity systems [...]
de Matos On solving multistage stochastic programs with general coherent risk measures [...]
Girardeau Modelling electricity prices and capacity expansions over a long-term horizon [...]
Barty A quantities decomposition scheme for energy management [...]
MA 550Nonlinear and combinatorial aspects in energy optimization [...]
Zaourar Prices stabilization for inexact unit-commitment problems [...]
Frangioni Exploiting structure in MIQP approaches to unit commitment problems [...]
Vespucci A procedure for minimizing variations of an initial operating point in medium-voltage AC network with distributed generation and storage devices [...]
PDE-constrained optimization & multi-level/multi-grid methods
MA 415Adaptive methods in PDE constrained optimization [...]
Wollner Adaptive finite element discretizations in structural optimization [...]
Hoppe Adaptive space-time finite element approximations of parabolic optimal control problems [...]
Robust optimization
MA 004Dynamic optimization and its applications [...]
Iancu Supermodularity and dynamic robust optimization [...]
Nohadani Robust evolution-based optimization in radiation therapy [...]
Goyal Static vs. dynamic robust optimization [...]
Sparse optimization & compressed sensing
H 1028Machine learning algorithms and implementations [...]
Schmidt Linearly-convergent stochastic gradient methods [...]
Oh Statistical analysis of ranking from pairwise comparisons [...]
Stochastic optimization
MA 141Methods of risk-averse optimization [...]
Fabian Computational aspects of risk-averse optimization [...]
Ruszczynski Methods for solving risk-averse dynamic optimization problems [...]
Dentcheva Decomposition methods for solving two-stage optimization problems with stochastic ordering constraints [...]
MA 144Recent advances in risk representation [...]
Delage Decision making under uncertainty when preference information is incomplete [...]
Pachamanova Skewness-aware asset allocation: A new theoretical framework and empirical evidence [...]
Chen An axiomatic approach to systemic risk [...]
MA 376Multistage stochastic mixed 0-1 optimization: Algorithms and applications [...]
Unzueta Scenario cluster Lagrangian decomposition [...]
Escudero Stochastic tactical supply chain management under uncertainty [...]
Garín A BFC-MS algorithm for solving multistage mixed 0-1 stochastic problems with risk averse stochastic dominance constraints [...]
Telecommunications & networks
H 3002Flow and path problems [...]
Thielen Maximum flows with minimum quantities [...]
Senatore The online replacement path problem [...]
Araujo An algorithm for the multi-terminal maximum flow [...]
Variational analysis
H 2035Nonsmooth analysis via piecewise-linearization [...]
Khan Evaluating an element of the Clarke generalized Jacobian of a piecewise differentiable function [...]
Griewank On piecewise linearization and lexicographic differentiation [...]
Fiege An exploratory line-search for piecewise smooth functions [...]
H 2051Variational inequalities and optimization problems on Riemannian manifolds [...]
Colao Equilibrium problems in Hadamard manifolds [...]
Leustean Firmly nonexpansive mappings in classes of geodesic spaces [...]
Oliveira Proximal and descent methods on Riemannian manifolds [...]


Tuesday, 13:15 - 14:45 h


Approximation & online algorithms
H 3010Travelling salesman problem I [...]
Sebő Shorter tours by nicer ears [...]
van Zuylen A proof of the Boyd-Carr conjecture [...]
Boyd The travelling salesman problem on cubic and subcubic graphs [...]
MA 041Practical implementations and models using approximation algorithms [...]
Carrasco Experimental results of approximation algorithms for energy aware scheduling [...]
Asgeirsson Performance of distributed game theoretic algorithms for single slot scheduling in wireless networks [...]
Phillips Scheduling and planning magnetic resonance imaging machines [...]
Combinatorial optimization
H 3004Cone factorizations and lifts of convex sets [...]
Vavasis Identifying k large submatrices using convex programming [...]
Gouveia Semidefinite lifts of polytopes [...]
Glineur Compact polyhedral approximations for convex sets defined by polynomials [...]
H 3005Lift-and-project methods for combinatorial optimization problems [...]
Chlamtac Reduced integrality gaps and improved approximations via lift-and-project methods [...]
Laurent Error bounds for sums of squares relaxations of some polynomial optimization problems [...]
Tulsiani Effectiveness and limitations of local constraints [...]
H 3008Combinatorics and geometry of linear optimization I [...]
Santos Counter-examples to the Hirsch conjecture [...]
Hähnle An abstract view on the polynomial Hirsch conjecture [...]
Zinchenko Polytopes and arrangements: Diameter and curvature [...]
H 3012Algorithms for transistor-level layout [...]
Nieberg BonnCell: Routing of leaf cells in VLSI design [...]
Schneider BonnCell: Placement of leaf cells in VLSI design [...]
Hougardy Transistor level layout: Algorithms and complexity [...]
H 3013Matching and related problems [...]
Bérczi Restricted b-matchings [...]
Takazawa Covering cuts in bridgeless cubic graphs [...]
Hartvigsen A generalized k-matching problem [...]
H 3021Sampling, sorting and graph traversal: Algorithms for finding permutations [...]
Miracle Mixing times of self-organizing lists and biased permutations [...]
Paluch Simpler approximation of the maximum asymmetric traveling salesman problem [...]
Complementarity & variational inequalities
MA 313MPECs in function space I [...]
Wachsmuth Convergence analysis of smoothing methods for optimal control of stationary variational inequalities [...]
Surowiec A PDE-constrained generalized Nash equilibrium problem with pointwise control and state constraints [...]
Rautenberg Hyperbolic quasi-variational inequalities with gradient-type constraints [...]
Conic programming
H 2036Advances in convex optimization [...]
Pena A smooth primal-dual perceptron-von Neumann algorithm [...]
Zuluaga Positive polynomials on unbounded domains [...]
Lotz Conditioning of the convex feasibility problem and sparse recovery [...]
H 2038Applications of semidefinite programming [...]
Ahmadi Joint spectral radius, path-complete graphs, and semidefinite programming [...]
Truetsch A "smart'' choice of a relaxation for the quadratic assignment problem within a branch-and-bound framework [...]
Doan Feature extraction and data clustering with SDP-representable norms [...]
Constraint programming
H 3003ACP hybrids for scheduling [...]
Lombardi Hybrid off-line/on-line workload scheduling via machine learning and constraint programming [...]
Beck Loosely coupled hybrids: Tabu search, constraint programming and mixed integer programming for job shop scheduling [...]
Feydy Lazy clause generation for RCPSP [...]
Derivative-free & simulation-based optimization
H 3503New techniques for optimization without derivatives [...]
Wright Defining non-monotone derivative-free methods [...]
Gray Calculating and using sensitivity information during derivative-free optimization routines [...]
Amaran A comparison of software and algorithms in unconstrained simulation optimization problems [...]
Finance & economics
H 3027Financial optimization [...]
Li A novel method for computing an optimal VaR portfolio [...]
Lin First-order algorithms for optimal trade execution with dynamic risk measures [...]
Moazeni Regularized robust optimization for optimal portfolio execution [...]
Game theory
MA 043Coordination mechanisms for efficient equilibria [...]
Gourves On the price of anarchy of the set cover game [...]
Müller Mechanism design for decentralized online machine scheduling [...]
Gairing Coordination mechanisms for congestion games [...]
Global optimization
H 2053Rigorous global optimization [...]
Schichl Balanced rigorous relaxation methods in global optimization [...]
Domes Finding global robust solutions of robust quadratic optimization problems [...]
Neumaier Projective methods for constraint satisfaction and global optimization [...]
Implementations & software
H 1058Software for constraint programming [...]
Shaw Automatic search in CP optimizer [...]
Nightingale Watched literals and generating propagators in constraint programming [...]
Tack Towards MiniZinc 2.0 [...]
Integer & mixed-integer programming
H 2013Advances in mixed integer programming [...]
Toriello Optimal toll design: A lower bound framework for the traveling salesman problem [...]
Zhang Cardinality-constrained continuous mixing set [...]
Fukasawa New inequalities for mixing sets arising in chance constrained programming [...]
H 2032Trends in mixed integer programming III [...]
He Minimum concave cost network flow over a grid network [...]
Kis Strengthening the MIP formulation of a bilevel lot-sizing problem [...]
Furini Heuristic and exact algorithms for the interval min-max regret knapsack problem [...]
Life sciences & healthcare
H 2033Bioinformatics and combinatorial optimization II [...]
Köster Protein hypernetworks [...]
Klau Charge group partitioning in biomolecular simulation [...]
Andonov Optimal DALI protein structure alignment [...]
Logistics, traffic, and transportation
H 0106Hub location problems [...]
Sender A local improvement heuristic for a hub location problem in wagonload traffic [...]
Armentano Tabu search for the hub covering problem [...]
H 0111Logistics and network optimization: New problems and new approaches [...]
Richter An integrated approach to tactical logistics network optimization [...]
Penn Cyclic routing of unmanned aerial vehicles [...]
Raviv Optimal control of battery switching stations [...]
Mixed-integer nonlinear programming
MA 005Advances in MINLP [...]
Terlaky Conic representation of the convex hull of disjunctions of convex sets and conic cuts for mixed integer second order cone optimization [...]
Drewes Cover inequalities and outer-approximation for mixed-01 SOCPs [...]
Morsi Solving MINLPs on loosely coupled networks [...]
Multi-objective optimization
H 1029Interactive multiobjective optimization [...]
Geiger Multi-objective inventory routing: Reference-point-based search, representations, and neighborhoods [...]
Miettinen Interactive Pareto Navigator method for nonconvex multiobjective optimization [...]
Trinkaus Multi criteria decision support in real-time [...]
Nonlinear programming
H 0107Methods for nonlinear optimization V [...]
Jaraczewski Interior point methods for a new class of minimum energy point systems on smooth manifolds [...]
Rozgic Interior point methods for the optimization of technological forming processes [...]
H 0110Nonlinear optimization V [...]
Ridzal A matrix-free trust-region SQP algorithm for large-scale optimization [...]
Forsgren Inexact Newton methods with applications to interior methods [...]
Zhou Numerical experience of a primal-dual active set method and its improvement [...]
H 0112Real-time optimization II [...]
Anitescu Scalable dynamic optimization [...]
Kirches A real-time iteration scheme for mixed-integer nonlinear model predictive control [...]
Borrelli Real-time stochastic predictive control applied to building control systems [...]
Nonsmooth optimization
H 1012Nonsmooth optimization methods [...]
Pietrus Some methods for solving perturbed variational inclusions [...]
Hendrich A double smoothing technique for solving nondifferentiable convex optimization problems [...]
Gustavsson Primal convergence from dual subgradient methods for convex optimization [...]
Optimization in energy systems
MA 549Stochastic programming applications in energy systems [...]
Petra Scalable stochastic optimization of power grid energy systems [...]
Klabjan Day ahead stochastic unit commitment with demand response and load shifting [...]
Defourny A quantile-based approach to unit commitment with wind [...]
MA 550Stochastic programming models for electricity generation planning [...]
Carreno Developing optimization software for Colombian power system planning [...]
Gonçalves Analyzing multistage stochastic optimization methods to solve the operation planning problem of hydrothermal systems [...]
Gendreau Midterm hydro generation scheduling under inflow uncertainty using the progressive hedging algorithm [...]
PDE-constrained optimization & multi-level/multi-grid methods
MA 415Optimization applications in industry I [...]
Tse Optimal boundary control of natural convection-radiation model in melting furnaces [...]
Sprekels Optimal control problems arising in the industrial growth of bulk semiconductor single crystals [...]
Stingelin Applications of optimal control in electromagnetic flow measurement [...]
Robust optimization
MA 004Applications of robust optimization I [...]
Yanikoglu Robust simulation-based optimization with Taguchian regression models [...]
Chen Robust sparse regression and orthogonal matching pursuit [...]
Ng Target-oriented robust optimization for gas field development planning [...]
MA 042Advances in robust optimization [...]
Xu A distributional interpretation of robust optimization, with applications in machine learning [...]
Houska Lifting methods for generalized semi-infinite programs [...]
Wiesemann Robust Markov decision processes [...]
Sparse optimization & compressed sensing
H 1028Coordinate descent methods for huge-scale optimization [...]
Richtarik Parallel block coordinate descent methods for huge-scale partially separable problems [...]
Takac Distributed block coordinate descent method: Iteration complexity and efficient hybrid implementation [...]
Tappenden Block coordinate descent method for block-structured problems [...]
Stochastic optimization
MA 141Stochastic optimization - Confidence sets, stability, robustness [...]
Vogel Confidence regions for level sets: Sufficient conditions [...]
Lachout Local information in stochastic optimization program [...]
Kopa Robustness in stochastic programs with risk and probabilistic constraints [...]
MA 144Topics in stochastic programming [...]
Royset Nonparametric estimation using exponential epi-splines [...]
Pasupathy On interior-point based retrospective approximation methods for solving two-stage stochastic linear programs [...]
MA 376Computational aspects of stochastic integer programming for large-scale and/or real-world problems [...]
Schweiger Multi-scenario topology optimization in gas networks [...]
Kießling ISPO – Integrated size and price optimization for a fashion discounter with many branches [...]
Rambau The stochastic guaranteed service model [...]
Telecommunications & networks
H 3002Tree problems [...]
Zey The stochastic Steiner tree problem: Models and solution strategies [...]
Moura Generalized degree constraints arising in wireless networks problems [...]
Raghavan Recoverable robust two level network design [...]
Variational analysis
H 2035Control and optimization of impulsive systems I [...]
Karamzin Existence theorems and Pontryagin's Maximum Principle for impulsive control problems [...]
Silva Optimal impulsive control problems under uncertainty [...]
de Oliveira An Invexity Type Condition on Impulsive Optimal Control Systems [...]
H 2051Regularity and sensitivity in multicriteria optimization [...]
Durea Metric regularity and Fermat rules in set-valued optimization [...]
Strugariu Metric regularity and subregularity of set-valued mappings with applications to vector optimization [...]
Zalinescu Variational principles for multifunctions and applications [...]


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
  Do you need Missouri Payday Loans as soon as possible? There are also a lot of other privileges for return customers. Men buy Viagra Gold online not to wait till the lucky event happens but to enjoy each sex act because Viagra effect lasts up to 36 hours!