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
Search
including talk |  session Mon | Tue | Wed | Thu | Fri
10:30 | 13:15 | 15:15 | any

Monday, 15:15 - 16:45 h

 

Approximation & online algorithms
H 3010Location and routing problems [...]
Nonner Polynomial-time approximation schemes for shortest path with alternatives [...]
Bock The school bus problem [...]
Panin On approximability some location and pricing problems [...]
Combinatorial optimization
H 3004Interactions between optimization and game theory in scheduling [...]
Uetz Mechanism design for single machine scheduling by ILP [...]
Hoeksma Price of anarchy for minsum related machine scheduling [...]
Olver Approximation algorithms for scheduling via coordination mechanisms [...]
H 3005Exact and approximation algorithms on graphs [...]
Cornaz Strengthening Lovász bound for coloring with a new graph transformation [...]
Meunier A routing problem raised by self-service bike hiring systems [...]
Bruhn Clique or hole in claw-free graphs [...]
H 3008Distances in graphs [...]
Agarwal The space-stretch-time tradeoff in distance oracles [...]
Wulff-Nilsen Approximate distance oracles with improved preprocessing and query time [...]
Roditty A survey on distance oracles [...]
H 3012Scheduling II [...]
Oster A branch and cut algorithm for solving capacitated max k-cut with an application in scheduling [...]
Tesch Optimization of the ISMP 2012 schedule [...]
H 3013Constrained clustering [...]
Borgwardt On the diameter of partition polytopes and vertex-disjoint cycle cover [...]
Shakhshshneyder Hardness and non-approximability of constrained clustering [...]
Brieden Constrained clustering with convex objective function [...]
H 3021Equilibria and combinatorial structures [...]
Kern Cooperative games and fractional programming [...]
Király Multiplayer multicommodity flows [...]
McCormick A primal-dual algorithm for weighted abstract cut packing [...]
Complementarity & variational inequalities
MA 041Analysis and learning in variational inequalities [...]
Jiang Learning parameters and equilibria in noise-corrupted Cournot games with misspecified price functions [...]
Robinson Local analysis of variational conditions [...]
Fischer A framework for smooth and nonsmooth equations with nonisolated solutions [...]
MA 313Optimization and equilibrium problems II [...]
Albrecht Inverse optimal control of human locomotion [...]
Facchinei Solving quasi-variational inequalities via their KKT conditions [...]
Kanzow Nash equilibrium multiobjective elliptic control problems [...]
Conic programming
H 2036Semidefinite programming applications [...]
Kim A successive SDP relaxation method for distance geometry problems [...]
Freund Implementation-robust design: Modeling, theory, and application to photonic crystal design with bandgaps [...]
Mizutani SDP relaxations for the concave cost transportation problem [...]
H 2038Matrix optimization [...]
Qi Computing the nearest Euclidean distance matrix [...]
Wu The Moreau-Yosida regularization of the Ky Fan k-norm related functions [...]
Monteiro An accelerated hybrid proximal extragradient method for convex optimization and its implications to second-order methods [...]
Constraint programming
H 3003AConstraint programming standard and industrial applications [...]
Castaneda Lozano Robust code generation using constraint programming [...]
Aggoun Modelling and solving a class of combinatorial problems in supply chain using the Choco constraint programming system [...]
Jussien JSR331 - Standard for Java constraint programming API [...]
Finance & economics
H 3027Risk management in finance and insurance [...]
Farkas Acceptability and risk measures: effectiveness, robustness and optimality [...]
Munari Risk measures and capital requirements with multiple eligible assets [...]
Pouliot Value-at-Risk [...]
Game theory
MA 043Design of optimal mechanisms [...]
Polukarov Optimal payments in dominant-strategy mechanisms for single-parameter domains [...]
Guo Computationally feasible automated mechanism design: General approach and a case study on budget-balanced and nearly efficient randomized mechanisms [...]
Mierendorff Generalized reduced-form auctions: A network-flow approach [...]
Global optimization
H 2053Algorithms and relaxations for nonconvex optimization Problems [...]
Ghaddar A global optimization approach for binary polynomial programs [...]
Kuno A class of convergent subdivision strategies in the conical algorithm for concave minimization [...]
Wechsung Improving relaxations of implicit functions [...]
Implementations & software
H 1058MILP software I [...]
Weninger SCIP preprocessing for MIPs arising in supply chain management [...]
Christophel Research topics of the SAS MILP solver development team [...]
Gamrath The SCIP Optimization Suite 3.0 - It's all in the bag! [...]
Integer & mixed-integer programming
H 2013MILP formulations II [...]
Schmieder Optimizing life cycle costs for buildings [...]
Fattahi A novel integer programming formulation for U-shaped line balancing problems type-1 [...]
H 2032Trends in mixed integer programming I [...]
Nannicini On the safety of Gomory cut generators [...]
Haus Split cuts for robust and generalized mixed-integer programming [...]
Günlük Lattice-free sets, branching disjunctions, and mixed-integer programming [...]
MA 042Linear optimization [...]
Chubanov An improved polynomial relaxation-type algorithm for linear programming [...]
Wunderling The kernel simplex method [...]
Sifaleras Exterior point simplex-type algorithms for linear and network optimization problems [...]
Life sciences & healthcare
H 2033Therapy planning [...]
Holm A new optimization model for brachytherapy dose plans [...]
Bokrantz Multi-criteria optimization for volumetric-modulated arc therapy by convex decompositions [...]
Göllmann Combination therapy considered as a multiple delayed optimal control problem [...]
Logistics, traffic, and transportation
H 0106Applications in transportation problems [...]
Magbagbeola Operations research approach to enhancing enterprise through alliances: A case study of Mowe Town, Ogun State, Nigeria [...]
Miura Comparative study of reduced total travel times in check-pattern and hierarchical express systems [...]
Pellegrini Exact models for the real time railway traffic management problem: tackling perturbed traffic considering real junction details [...]
H 0111Network problems [...]
Kalinowski Scheduling arc outages in networks to maximize total flow over time [...]
Teo Solving network flow problems with general non-separable convex costs using a two-phase gradient projection algorithm [...]
Mixed-integer nonlinear programming
MA 005Tight relaxations [...]
Lehmann On the efficient construction of disjunctive cutting planes for mixed-integer quadratic optimization problems [...]
Michaels The convex hull of vectors of functions [...]
Gleixner Rapid optimality-based bound tightening [...]
Multi-objective optimization
H 1029Multi-objective optimization [...]
Flores-Tlacuahuac An utopia-tracking approach to multiobjective predictive control [...]
Ogryczak Fair multiobjective optimization: Models and techniques [...]
Goetzmann Compromise solutions [...]
Nonlinear programming
H 0107Methods for nonlinear optimization III [...]
Shen New augmented lagrangian-based proximal point algorithms for convex optimization with equality constraint [...]
Al-Baali Hybrid damped-BFGS/Gauss-Newton methods for nonlinear least-squares [...]
Ahookhosh An improved nonmonotone technique for both line search and trust-region frameworks [...]
H 0110Nonlinear optimization III [...]
Solodov Convergence properties of augmented Lagrangian methods under the second-order sufficient optimality condition [...]
Curtis Infeasibility detection in nonlinear optimization [...]
Oztoprak Two-phase active set methods with applications to inverse covariance estimation [...]
H 0112Unconstrained optimization I [...]
Babaie-Kafaki A modification on the Hager-Zhang conjugate gradient method [...]
Odland On the relationship between quasi-Newton methods and the conjugate [...]
Marcia Limited-memory BFGS with diagonal updates [...]
Nonsmooth optimization
H 1012Nonsmooth optimization in imaging sciences I [...]
Peyré A review of proximal splitting methods with a new one [...]
Pock On parameter learning in variational models [...]
Cevher Nonconvex models with exact and approximate projections for constrained linear inverse problems [...]
Optimization in energy systems
MA 549Optimisation models for renewables integration [...]
Sauma Transmission planning and generation response for integrating renewables [...]
Moreno Transmission network operation and planning with probabilistic security to facilitate the connection of renewable generation [...]
Fanzeres Backing up wind power firm contract sales on hydro generation with stochastic optimization: A Brazilian case study [...]
MA 550Stochastic optimization for electricity production and trading [...]
Martin Multistage stochastic optimization of power dispatch and multiperiod duality of CVaR [...]
Pflug Stochastic bilevel programs with applications to electricity contracts [...]
Analui Multistage stochastic optimization problems under model ambiguity [...]
PDE-constrained optimization & multi-level/multi-grid methods
MA 415Numerical methods in shape and topology optimization [...]
Sturm Shape optimization for an interface problem in linear elasticity for distortion compensation [...]
Schulz On the usage of the shape Hessian in aerodynamic shape optimization [...]
Robust optimization
H 3503Extensions of robust optimization approaches [...]
Thipwiwatpotjana Pessimistic, optimistic, and min-max regret approaches for linear programs under uncertainty [...]
Römer Linear optimization with variable parameters: Robust and generalized linear programming and their relations [...]
Nasrabadi A fuzzy programming approach to robust optimization [...]
MA 004Robust network optimization [...]
Stiller Robust network flows [...]
Adjiashvili Fault-tolerant shortest paths - Beyond the uniform failure model [...]
Sparse optimization & compressed sensing
H 1028Global rate guarantees in sparse optimization [...]
Yin Augmented L1 and nuclear-norm minimization with a globally linearly convergent algorithm [...]
Xiao A proximal-gradient homotopy method for the sparse least-squares problem [...]
Baes First-order methods for eigenvalue optimization [...]
Stochastic optimization
MA 141Solution methods for constrained stochastic optimization [...]
Kunnumkal Randomization approaches for network RM with choice behavior [...]
Rudolf Optimization with multivariate conditional-value-at-risk constraints [...]
MA 144Approximation algorithms for stochastic revenue management optimization [...]
Levi Near-optimal algorithms for assortment planning under dynamic substitution and stochastic demand [...]
Ciocan Dynamic allocation problems with volatile demand [...]
Shi Revenue management of reusable resources with advanced reservations [...]
MA 376Advances in probabilistically constrained optimization [...]
Lejeune Threshold boolean form for the reformulation of joint probabilistic constraints with random technology matrix [...]
Shabbir Probabilistic set covering with correlations [...]
Krokhmal On polyhedral approximations in p-order conic programming [...]
Telecommunications & networks
H 3002Optimization of optical networks [...]
Jaumard Path vs. cutset column generaton models for the design of IP-over-WDM optical networks [...]
Haahr Heuristic planning of shared backup path protection [...]
Mahey Algorithms for lower and upper bounds for routing and wavelength assignment [...]
Variational analysis
H 2035Lower order exact penalty functions [...]
Yang Optimality conditions via exact penalty functions [...]
Tian An interior-point l1/2-penalty method for nonlinear programming [...]
Chen Exact penalty functions for semi-infinite programming [...]
H 2051Some applications of variational analysis [...]
Nguyen Variational analysis of minimal time functions with unbounded dynamics and generalized smallest enclosing circle problems [...]
Eberhard Approaches to optimality conditions using nonsmooth and variational methods [...]
Lee On constraint qualifications for mathematical programs with equilibrium constraints [...]

 

Sorted by cluster |  Room Mon | Tue | Wed | Thu | Fri
10:30 | 13:15 | 15:15 | any
  cash advance . Cialis Professional online is capableto release you reliably from the erection problems, its improved formula gives the new properties to the drug.