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

Friday, 13:15 - 14:45 h

 

Approximation & online algorithms
H 3010Scheduling and online algorithms [...]
Grigoriu Scheduling on uniform processors with at most one downtime on each machine [...]
Flatberg Online bin covering with lookahead and bounded space [...]
Potts On-line production planning to maximize on-time orders [...]
Combinatorial optimization
H 3004Packing, covering and domination I [...]
Wagler Generalized row family inequalities for the set covering polyhedron [...]
Argiroffo The identifying code polyhedron of cycles [...]
Valicov Complexity of identifying codes in some subclasses of perfect graphs [...]
H 3005Nonlinear combinatorial optimisation problems I [...]
Baumann Exact algorithms for combinatorial optimization problems with submodular objective functions [...]
Liers A polyhedral approach to the quadratic matching problem [...]
Narayanan Some properties of integer hulls of convex sets [...]
H 3013Facility location [...]
Rybicki Improved LP-rounding approximation algorithm for k-level uncapacitated facility location [...]
Ahmadian Improved approximation guarantees for lower-bounded facility location [...]
Complementarity & variational inequalities
MA 313Variational inequality problems: Analysis and computation [...]
Shanbhag On the analysis and solution of stochastic variational inequalities [...]
Su Estimation of pure characteristics demand models with pricing [...]
Xu Quantitative stability analysis of stochastic generalized equations and applications [...]
Conic programming
H 2036Algebraic geometry and conic programming, part II [...]
Nie Certifying convergence of Lasserre's hierarchy via flat truncation [...]
Ninin Abstract cones of positive polynomials and sums of squares [...]
Uschmajew Convergence of algorithms on quotient manifolds of Lie groups [...]
H 2038Warmstarting interior point methods [...]
Skajaa Warmstarting the homogeneous and self-dual interior point method for linear and conic quadratic problems [...]
Yildirim Warm-start strategies: What matters more? [...]
González-Brevis A new warm-starting strategy for the primal-dual column generation method [...]
Derivative-free & simulation-based optimization
H 3003AMultiple objectives in derivative-free optimization [...]
Rinaldi Using an exact penalty function for multiobjective Lipschitz programs [...]
Vicente Efficient cardinality/mean-variance portfolios [...]
Custodio Direct MultiSearch: A robust and efficient approach to multiobjective derivative-free optimization [...]
Finance & economics
H 3021Risk management under probability model misspecification [...]
Wozabal Robustifying convex risk measures: A non-parametric approach [...]
Demiguel Stock return serial dependence and out-of-sample portfolio performance [...]
H 3027Generalized nash equilibrium problems [...]
Renner Computing generalized Nash equilibria by polynomial programming [...]
Spieksma Testing rationality: algorithms and complexity [...]
Couzoudis Finding all generalized Nash equilibria [...]
Game theory
MA 005Competition on networks [...]
Nikolova A mean-risk model for the stochastic traffic assignment problem [...]
Stier-Moses The competitive facility location problem in a duopoly: Advances beyond trees [...]
Ordonez Stackelberg security games on networks [...]
MA 043Equilibria in congestion games [...]
von Falkenhausen Optimal cost sharing protocols for matroid congestion games [...]
Pradeau Uniqueness of equilibrium on rings [...]
Klimm Existence and computation of equilibria in bottleneck congestion games [...]
Global optimization
H 0110Algorithms and applications [...]
Prudente An augmented Lagrangian method with finite termination [...]
Bueno Low order-value approach for solving VaR-constrained optimization problems [...]
Andretta Deterministic and stochastic global optimization techniques for planar covering with elipses problems [...]
H 2053Advances in global optimization V [...]
Bigi Beyond canonical DC programs: The single reverse polar problem [...]
Konzett Numerical enclosures of solution manifolds at near singular points [...]
Gabidullina Universal measure of the thickness of separator or pseudo-separator for sets of Euclidean space [...]
Implementations & software
H 1058Conic linear programming [...]
Helmberg Speeding up the spectral bundle method by solving the quadratic semidefinite subproblems with a PSQMR approach [...]
Jarre Solving large scale problems over the doubly nonnegative cone [...]
Toh An inexact accelerated proximal gradient method for large scale convex quadratic SDP [...]
Integer & mixed-integer programming
H 2013Trends in integer programming [...]
Basu A (k+1)-slope theorem for the k-dimensional infinite group relaxation [...]
Shen Bilevel interdiction and risk-and-return tradeoffs in probabilistic programs with single or multiple chance constraints [...]
Ryan Computing pure Nash equilibria in symmetric games [...]
H 2032Integer points in polytopes I [...]
De Loera Top Ehrhart coefficients of knapsack problems [...]
Gubeladze Continuous evolution of lattice polytopes [...]
Averkov Lattice-free integer polyhedra and their application in cutting-plane theory [...]
H 2033Cutting plane theory [...]
Del Pia On the rank of disjunctive cuts [...]
Buyuktahtakin Partial objective function inequalities for the multi-item capacitated lot-sizing problem [...]
Hildebrand The triangle closure is a polyhedron [...]
Life sciences & healthcare
MA 376Cell biology [...]
Gao Towards automatic NMR protein structure determination [...]
Mestre Tree-constrained matching [...]
Andreotti De novo peptide sequencing with mathematical programming [...]
Logistics, traffic, and transportation
H 0106Revenue management applications [...]
Jagabathula Assortment optimization under general choice [...]
den Boer Simultaneously learning and optimizing in dynamic pricing and revenue management [...]
Davis Assortment optimization under variants of the nested logit model [...]
MA 042Optimization in logistics [...]
Frey Column generation for planning the outbound baggage handling at airports [...]
Funke A mixed integer program for a variant of the truck and trailer routing problem with time windows [...]
Fügenschuh Scheduling and routing of fly-in safari airplanes [...]
Mixed-integer nonlinear programming
MA 041Applications of MINLP II [...]
Huang Primal heuristics for nonconvex MINLPs modelling optimal operation of water distribution networks [...]
Held Challenges and requirements for MINLPs in industrial applications [...]
Multi-objective optimization
H 1029Portfolio selection [...]
Abad Portfolio selection with multiple spectral risk constraints [...]
Yaghoobi Using ball center of a polytope to solve a multiobjective linear programming problem [...]
Nonlinear programming
H 0107Stability and solution methods [...]
Klatte Metric regularity versus strong regularity for critical points of nonlinear programs [...]
Bütikofer Influence of inexact solutions in a lower level problem on the convergence behavior of a nonsmooth newton method [...]
Kummer Newton schemes for functions and multifunctions [...]
H 0112Optimality conditions I [...]
Ahmetoğlu Necessary conditions for a convex programming problem in Banach spaces partially ordered by a cone with empty interior [...]
MA 004Fast gradient methods for nonlinear optimization and applications I [...]
Hongchao An adaptive preconditioned nonlinear conjugate gradient method with limited memory [...]
Diao A sequential quadratic programming method without a penalty function or a filter for general nonlinear constrained optimization [...]
Toraldo On the use of spectral properties of the steepest descent method [...]
Nonsmooth optimization
H 1012Nonsmooth optimization and applications [...]
Noll Non-convex bundle algorithm with inexact sub-gradient and function values [...]
Fischer An asynchronous parallel bundle method for Lagrangian relaxation [...]
Optimization in energy systems
MA 550Stochastic equilibria in energy markets I [...]
Zakeri Models for large consumer peak shaving and the impact on line pricing [...]
de Maere Modelling market liquidity in restructured power systems by stochastic Nash and generalized Nash equilibrium [...]
Ehrenmann Risk adjusted discounting [...]
MA 550Generation and expansion problems [...]
Lindahl Discrete optimization support system for the collection grid in large offshore wind parks [...]
Zigrino A multistage stochastic model for the electric power generation capacity expansion problem of a price-taker power producer in a multi-year horizon [...]
Cada Optimizing nuclear fuel reload patterns [...]
PDE-constrained optimization & multi-level/multi-grid methods
H 0111PDE-constrained optimization problems with non-smooth structures [...]
Luong A multiresolution algorithm for large scale non-smooth convex optimization problems [...]
Vallejos Multigrid methods for elliptic optimal control problems with pointwise mixed control-state constraints [...]
Löbhard Optimal control of elliptic variational inequalities: A mesh-adaptive finite element solver [...]
MA 415Hierarchical methods for the design of nanoporous materials [...]
Boggs Combining multi-grid and domain decomposition as preconditioners for a class of multi-level PDE-constrained optimization problems [...]
Gay Optimization algorithms for hierarchical problems, with application to nanoporous materials [...]
Lewis Using inexact gradients in a multilevel optimization algorithm [...]
Sparse optimization & compressed sensing
H 1028Structured matrix optimization [...]
van den Berg Phase-retrieval using explicit low-rank matrix factorization [...]
Harchaoui Lifted coordinate descent for learning with Gauge regularization [...]
Dhillon Sparse inverse covariance matrix estimation using quadratic approximation [...]
Stochastic optimization
MA 141Target oriented optimization under uncertainity [...]
Long Managing operational and financing decisions to meet consumption targets [...]
Qi Routing optimization with deadlines under uncertainty [...]
MA 144Stochastic algorithms [...]
Luo A nonadaptive probabilistic group testing algorithm for detecting consecutive positives of linear DNA library [...]
Hansen Information-geometric optimization [...]
Theile How crossover helps in pseudo-boolean optimization [...]
Telecommunications & networks
H 3002Game theoretic concepts in telecommunications [...]
Medel Optimal regulation with non discriminatory prices in mobile two way access, with call externalities and heterogeneous costumers [...]
Krolikowski Game theoretic model for the downlink in cellular mobile networks: Nash equilibria and algorithmic convergence [...]
H 3503Markovian and randomized techniques for network optimization [...]
Fercoq Polyhedral and ergodic control approaches to PageRank optimization and spam detection [...]
Gómez Development of a hybrid algorithm based on the application of metaheuristics on an Internet Protocol Television platform using Tabu Search (TS) and Genetic Algorithm (GA) [...]
Guzman Network congestion control with Markovian multipath routing [...]
Variational analysis
H 2035Optimization in infinite dimensional spaces [...]
Blot Discrete-time Pontryagin principles and ordered Banach spaces [...]
Donchev Runge-Kutta methods for differential equations with variable time of impulses [...]
Resmerita A discrepancy principle for the augmented Lagrangian method [...]
H 2051Duality in convex optimization [...]
Csetnek Conjugate duality and the control of linear discrete systems [...]
Heinrich The support vector machines approach via Fenchel-type duality [...]
Grad Classical linear vector optimization duality revisited [...]

 

Sorted by cluster |  Room Mon | Tue | Wed | Thu | Fri
10:30 | 13:15 | 15:15 | any
  Most online loan lenders allow getting New Jersey Loans Online without visiting a bank, straight to your bank account. If you have already decided to take Levitra, be sure to consult a doctor, you don't have any contraindications and act strictly due to a prescription.