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

Wednesday, 13:15 - 14:45 h


Approximation & online algorithms
H 3010Approximation in routing and scheduling [...]
Soto The traveling salesman problem in cubic graphs [...]
Verschae The power of recourse for online MST and TSP [...]
Telha The jump number (maximum independent set) of two-directional orthogonal-ray graphs [...]
Combinatorial optimization
H 3004Extended formulations in discrete optimization III [...]
Tiwary Extended formulations for polygon [...]
Conforti Extended formulations in mixed-integer programming [...]
Zambelli Mixed-integer bipartite vertex covers and mixing sets [...]
H 3005Geometric combinatorial optimization [...]
Queyranne Modeling convex subsets of points [...]
Dragoti-Cela On the x-and-y axes travelling salesman problem [...]
H 3008Combinatorics and geometry of linear optimization IV [...]
Gärtner Abstract optimization problems revisited [...]
Di Summa A new bound on the diameter of polyhedra [...]
Kim Subset partition graphs and an approach to the linear Hirsch conjecture [...]
H 3012Heuristics II [...]
Bouamama A population-based iterated greedy algorithm for the minimum weight vertex cover problem [...]
Djadoun Random synchronized prospecting: A new metaheuristic for combinatorial optimization [...]
H 3013Assignment problems [...]
Dahl Generalized Birkhoff polytopes and majorization [...]
Heismann The hypergraph assignment problem [...]
H 3021Graph partitioning and clustering [...]
Werneck Exact combinatorial branch-and-bound for graph bisection [...]
Christian High quality graph partitioning [...]
Meyerhenke Current trends in graph clustering [...]
Complementarity & variational inequalities
MA 313Advances in the theory of complementarity and related problems II [...]
Lignola Mathematical programs with quasi-variational inequality constraints [...]
Gwinner On linear differential variational inequalities [...]
Conic programming
H 2036Semidefinite programming and geometric representations of graphs [...]
Reiss Optimizing extremal eigenvalues of the weighted Laplacian of a graph [...]
de Carli Silva Optimization problems over unit-distance representations of graphs [...]
Varvitsiotis Two new graph parameters related to semidefinite programming with a rank constraint [...]
H 2038Conic and convex programming in statistics and signal processing III [...]
Needell Randomized projection algorithms for overdetermined linear systems [...]
Wright Packing ellipsoids (and chromosomes) [...]
Saunderson Polynomial-sized semidefinite representations of derivative relaxations of spectrahedral cones [...]
Constraint programming
H 3003AConstraint solvers and implementations [...]
Schulte Gecode: An open constraint solving library [...]
De Backer Constraint programming and optimization at Google [...]
Prud'homme A DSL for programming propagation engine [...]
Derivative-free & simulation-based optimization
H 3503Derivative-free applications and parallelization [...]
Martinez Design of river fishways: A derivative-free optimization perspective [...]
Vaz Vibration-based structural health monitoring based on a derivative-free global optimization approach [...]
Olsson Parallelization of algorithms for derivate-free optimization [...]
Finance & economics
H 3027Optimization methodologies in computational finance [...]
Fulga Portfolio optimization with a new quantile-based risk measure and prior AHP stock ranking [...]
Xu A new sampling strategy willow tree method with application to path-dependent option pricing [...]
Shupo Optimal promotion rate in a cash campaign [...]
Game theory
MA 005Polynomial-time algorithms for mechanism design [...]
Krysta Combinatorial auctions with verification [...]
Csapo The private provision of a public good: Digging for gold [...]
Vidali Scheduling, auctions and truthfulness [...]
MA 043Analysis of auction mechanisms [...]
Paes Leme Polyhedral clinching auctions and the AdWords polytope [...]
Caragiannis Welfare and revenue guarantees in sponsored search auctions [...]
Syrgkanis Efficiency in sequential auctions [...]
Global optimization
H 2053Global optimization methods and applications [...]
Pardalos Global optimality conditions in non-convex optimization [...]
Moreno-Centeno Solving combinatorial optimization problems as implicit hitting set problems [...]
Buchanan Maximum clique problem on very large scale sparse networks [...]
Implementations & software
H 0110Exact MIP/LP solvers [...]
Hoffmann Integration of an LP solver into interval constraint propagation [...]
Wolter An exact rational mixed-integer programming solver [...]
Parekh Computing certificates for integer programs [...]
H 1058Software for PDE-constrained optimization [...]
Young Software abstractions for matrix-free PDE optimization with cone constraints [...]
Potschka MUSCOP: A multiple shooting code for time-periodic parabolic PDE constrained optimization [...]
Kourounis Gradient-based optimization using adjoint methods for optimization of compositional flow in porous media [...]
Integer & mixed-integer programming
H 2013Scheduling II [...]
Thörnblad A time-indexed formulation of a flexible job shop problem including preventive maintenance and availability of fixtures [...]
Wojciechowski Opportunistic replacement scheduling with interval costs [...]
Gokce Scheduling for disassembly systems [...]
H 2032Polyhedral theory [...]
Michini How tight is the corner relaxation? Insights gained from the stable set problem [...]
Poirrier The strength of multi-row models [...]
Doostmohammadi Valid inequalities for the single arc design problem with set-ups [...]
H 2033Lattices and integer programming [...]
von Heymann The structure of LLL-reduced kernel lattice bases: Theoretical details [...]
Aardal The structure of LLL-reduced kernel lattice bases: background and outline of the main result [...]
Lodi On cutting planes and lattice reformulations [...]
Life sciences & healthcare
MA 376(Next generation) sequences [...]
Canzar Transcriptome reconstruction using delayed column generation [...]
Marschall CLEVER: Clique-enumerating variant finder [...]
Pape Computational complexity of the multiple sequence alignment problem [...]
Logistics, traffic, and transportation
H 0104TomTom routing and traffic research: data, models and algorithms [...]
Schilling TomTom Navigation - How mathematics help getting through traffic faster [...]
Kesting The dynamics of traffic jams - How data and models help to understand the principles behind [...]
Koenig Crowd-sourcing in navigation - How selfish drivers help to reduce congestion for all [...]
H 0106Math programming in supply chain applications [...]
Rusmevichientong Robust assortment optimization [...]
Cohen Designing consumer subsidies with industry response for green technology adoption [...]
Harsha Demand-response in the electricity smart grid: A data-driven pricing and inventory optimization approach [...]
H 0111New algorithms for new pricing models [...]
Briceño-Arias Optimal continuous pricing with strategic consumers [...]
Goel Reputation and trust in social networks [...]
Malekian Bayesian optimal auctions via multi- to single-agent reduction [...]
Mixed-integer nonlinear programming
MA 041Structured MINLP and applications [...]
Lastusilta Chromatographic separation using GAMS extrinsic functions [...]
Goldberg Cover inequalities for nearly monotone quadratic MINLPs [...]
Margulies Hilbert's Nullstellensatz and the partition problem: An infeasibility algorithm via the partition matrix and the partition polynomial [...]
MA 042Topics in mixed-integer nonlinear programming II [...]
Calinescu Optimal resource allocation in survey designs [...]
Engelhart A new test-scenario for analysis and training of human decision making with a tailored decomposition approach [...]
Multi-objective optimization
H 1029Nonlinear multiobjective optimization [...]
Steponavice On robustness for simulation-based multiobjective optimization [...]
Lucambio Perez A modified subgradient algorithm for solving K-convex inequalities [...]
Nonlinear programming
H 0107Regularization techniques in optimization II [...]
Bellavia Regularized Euclidean residual algorithm for nonlinear least-squares with strong local convergence properties [...]
Morini Preconditioning of sequences of linear systems in regularization techniques for optimization [...]
Gratton Preconditioning inverse problems using duality [...]
H 0112Applications of optimization I [...]
Yamashita An approach based on shortest path and connectivity consistency for sensor network localization problems [...]
Patriksson Nonlinear continuous resource allocation - A numerical study [...]
Steinbach Estimating material parameters by X-ray diffraction [...]
Nonsmooth optimization
H 1012Applications of nonsmooth optimization [...]
Strömberg Lagrangian optimization for inconsistent linear programs [...]
Xavier The continuous multiple allocation p-hub median problem solving by the hyperbolic smoothing approach: Computational performance [...]
Sadoghi Piecewise monotonic regression algorithm for problems comprising seasonal and monotonic trends [...]
Optimization in energy systems
MA 549Robust aspects of optimization in energy management [...]
van Ackooij Decomposition methods for unit-commitment with coupling joint chance constraints [...]
Möller Probabilistic programming in power production planning [...]
Kovacevic A process distance approach for scenario tree generation with applications to energy models [...]
MA 550Stochastic optimization applied to power systems [...]
Lumbreras Efficient incorporation of contingency scenarios to stochastic optimization. Application to power systems. [...]
Cerisola Approximations of recourse functions in hydrothermal models. Numerical experiencies. [...]
Munoz Using decomposition methods for wide-area transmission planning to accommodate renewables: A multi-stage stochastic approach [...]
PDE-constrained optimization & multi-level/multi-grid methods
MA 415Optimization applications in industry IV [...]
Pesch Direct versus indirect solution methods in real-life applications: Load changes of fuel cells [...]
Landry Modeling of the optimal trajectory of industrial robots in the presence of obstacles [...]
Désidéri Multiple gradient descent algorithm (MGDA) for multi-objective optimization with application to compressible aerodynamics [...]
Robust optimization
MA 004Applications of robust optimization IV [...]
Vera Improving consistency of tactical and operational planning using robust optimization [...]
Bruns Robust load planning of trains in intermodal transportation [...]
Poirion Robust optimal sizing of an hybrid energy stand-alone system [...]
Sparse optimization & compressed sensing
H 1028Efficient first-order methods for sparse optimization and its applications [...]
Ma An alternating direction method for latent variable Gaussian graphical model selection [...]
Lu Sparse approximation via penalty decomposition methods [...]
Goldfarb An accelerated linearized Bregman method [...]
Stochastic optimization
MA 141Scenario generation in stochastic optimization [...]
Papp Generating moment matching scenarios using optimization techniques [...]
Pennanen Tractability of stochastic programs [...]
Desai A mathematical programming framework for decision tree analysis [...]
MA 144Large-scale stochastic programming [...]
Grothey Multiple-tree interior point method for stochastic programming [...]
Lubin Parallel and distributed solution methods for two-stage stochastic (MI)LPs [...]
Römisch Are quasi-Monte Carlo methods efficient for two-stage stochastic programs? [...]
Telecommunications & networks
H 3002Length bounded trees [...]
Ljubic Layered graph models for hop constrained trees with multiple roots [...]
Leitner New models for the diameter constrained steiner tree problem [...]
Bley Capacitated facility location with length bounded trees [...]
Variational analysis
H 2035Structural properties in variational analysis [...]
Mordukhovich Second-Order variational analysis and stability in optimization [...]
Lewis Active sets and nonsmooth geometry [...]
Lu Confidence regions and confidence intervals for stochastic variational inequalities [...]
H 2051Equilibrium problems: Formulations and methodologies [...]
Daniele General financial models: Methodologies and suggestions for the recovery [...]
Crespi Minty variational principle in set optimization [...]
Wakolbinger A variational inequality formulation of economic network equilibrium models with nonlinear constraints [...]


Sorted by cluster |  Room Mon | Tue | Wed | Thu | Fri
10:30 | 13:15 | 15:15 | any
  Payday Loans In Illinois. It is strictly forbidden to administrate Cialis Soft online in conjunction with medications, which are composed of nitrates - antidepressants, drastic analgetic pills, sleeping pills, and others.