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

Wednesday, 10:30 - 12:00 h

 

Approximation & online algorithms
H 3010Scheduling and packing: Approximation with algorithmic game theory in mind [...]
Epstein Generalized selfish bin packing [...]
Levin A unified approach to truthful scheduling on related machines [...]
van Stee The price of anarchy for selfish ring routing is two [...]
Combinatorial optimization
H 3004Extended formulations in discrete optimization II [...]
Van Vyve Projecting an extended formulation [...]
Pashkovich Constructing extended formulations using polyhedral relations [...]
Theis Some lower bounds on sizes of positive semidefinite extended formulations [...]
H 3005Algorithm for matrices and matroids [...]
Walter A simple algorithm for testing total unimodularity of matrices [...]
Pitsoulis Decomposition of binary signed-graphic matroids [...]
H 3008Combinatorics and geometry of linear optimization III [...]
Mizuno An upper bound for the number of different solutions generated by the primal simplex method with any selection rule of entering variables [...]
Adler The equivalence of linear programs and zero-sum games [...]
Zwick Subexponential lower bounds for randomized pivoting rules for the simplex algorithm [...]
H 3012Heuristics I [...]
Badri A divide-and-bridge heuristic for Steiner minimal trees on the Euclidean plane [...]
Umetani A heuristic algorithm for the set multicover problem with generalized upper bound constraints [...]
H 3013Network flows [...]
Afsharirad Maximum dynamic flow interdiction problem [...]
Karrenbauer Planar min-cost flow in nearly O(n3/2) [...]
Chekuri Multicommodity flows and cuts in polymatroidal networks [...]
H 3021Routing for public transportation [...]
Müller-Hannemann Coping with delays: Online timetable information and passenger-oriented train disposition [...]
Pajor Round-based public transit routing [...]
Bast Next-generation route planning: Multi-modal, real-time, personalized [...]
Complementarity & variational inequalities
MA 041Complementarity modeling and its game theoretical applications [...]
Neogy Generalized principal pivot transforms, complementarity problem and its applications in game theory [...]
Gupta Complementarity model for a mixture class of stochastic game [...]
Das A complementarity approach for solving two classes of undiscounted structured stochastic games [...]
MA 313Advances in the theory of complementarity and related problems I [...]
Chen Lipschitz continuity of solution mapping of symmetric cone complementarity problem [...]
Kurennoy On regularity conditions for complementarity problems [...]
Conic programming
H 2036New conic optimization approaches for max-cut and graph equipartition [...]
Krislock Improved semidefinite bounding procedure for solving max-cut problems to optimality [...]
Schmutzer Branch-and-cut for the graph 2-equipartition problem [...]
Wiegele Lasserre hierarchy for max-cut from a computational point of view [...]
H 2038Conic and convex programming in statistics and signal processing II [...]
Ward Robust image recovery via total-variation minimization [...]
Tropp Sharp recovery bounds for convex deconvolution, with applications [...]
Shah Group symmetry and covariance regularization [...]
Constraint programming
H 3003AModeling and reformulation [...]
Wallace Inferring properties of models from properties of small instances [...]
Simonis Building global constraint models from positive examples [...]
Miguel Towards automated constraint modelling with essence and conjure [...]
Derivative-free & simulation-based optimization
H 3503Exploiting structure in derivative-free optimization [...]
Kelley Sparse interpolatory models for molecular dynamics [...]
Hare Derivative free optimization for finite minimax functions [...]
Regis A derivative-free trust-region algorithm for constrained, expensive black-box optimization using radial basis functions [...]
Finance & economics
H 3027Price dynamics in energy markets [...]
Erdős Have oil and gas prices got separated? [...]
Schuerle Price dynamics in gas markets [...]
Paraschiv Modelling negative electricity prices [...]
Game theory
MA 005Games over networks [...]
Ozdaglar Network security and contagion [...]
Parrilo Near-potential network games [...]
Jadbabaie A game-theoretic model of competitive contagion and product adoption in social networks [...]
MA 043Variational inequalities in games [...]
Golshtein Many-person games with convex structure [...]
Jain Constrained vector-valued dynamic game and symmetric duality for multiobjective variational problems [...]
Global optimization
H 2053Optimal hybrid control theory approaches to global optimization [...]
Zabinsky Solving non-linear discrete optimization problems via continualization: An interior-point algorithm [...]
Kohn Hybrid dynamic programming for rule constrained multi-objective optimization [...]
Zhang Stochastic control optimization of a binary integer program [...]
Implementations & software
H 1058Implementations of interior point methods for linear and conic optimization problems [...]
Meszaros Exploiting hardware capabilities in implementations of interior point methods [...]
Andersen On recent improvements in the interior-point optimizer in MOSEK [...]
Polik Crossing over [...]
Integer & mixed-integer programming
H 2013Scheduling I [...]
Alfares Integer programming model and optimum solution for a bi-objective days-off scheduling problem [...]
Felt MILP model for athletic conference scheduling [...]
Raith Minimising tardiness in parallel machine scheduling with setup times and mould type restrictions [...]
H 2032Trends in mixed integer programming IV [...]
Soumis Integral simplex using decomposition [...]
Malaguti Algorithms for 2-dimensional 2-staged guillotine cutting stock problems [...]
Eisenbrand On bin packing, the MIRUP conjecture and discrepancy theory [...]
H 2033Assignments and partitioning [...]
Fan A heuristic for the local region covering problem [...]
Dokka Fast separation algorithms for multi-dimensional assignment problems [...]
Logistics, traffic, and transportation
H 0106Vehicle routing and logistics optimization [...]
Ruthmair An adaptive layers framework for vehicle routing problems [...]
Roberti Dynamic NG-path relaxation [...]
Vigo An exact approach for the clustered vehicle routing problem [...]
H 0111Stochastic routing [...]
Demeyer Time-dependent stochastic routing: A practical implementation [...]
Kobitzsch Alternative routes and route corridors [...]
Blandin Fast computation of solution to stochastic on-time arrival problem [...]
Mixed-integer nonlinear programming
MA 042Topics in mixed-integer nonlinear programming I [...]
Galli Reformulating mixed-integer quadratically constrained quadratic programs [...]
Niu On combination of DCA branch-and-bound and DC-Cut for solving mixed-01 linear programs [...]
Schöbel A geometric branch and bound approach for nonlinear mixed-integer optimization [...]
Multi-objective optimization
H 1029Vector optimization: Post pareto analysis [...]
Bonnel Semivectorial bilevel optimal control problems: Optimality conditions [...]
Collonge Optimization over the Pareto set associated with a multi-objective stochastic convex optimization problem [...]
Morgan Semivectorial bilevel convex optimal control problems: Existence results [...]
Nonlinear programming
H 0107Regularization techniques in optimization I [...]
Gondzio Recent advances in the matrix-free interior point method [...]
Armand A boundedness property of the Jacobian matrix arising in regularized interior-point methods [...]
Saunders QPBLUR: A regularized active-set method for sparse convex quadratic programming [...]
H 0110Trust-region methods and nonlinear programming [...]
Yuan Optimality conditions and smoothing trust region newton method for non-lipschitz optimization [...]
Pong Generalized trust region subproblem: Analysis and algorithm [...]
Cheung Solving a class of quadratically constrained semidefinite prgramming problems with application to structure based drug design problem [...]
H 0112Solution methods for matrix, polynomial, and tensor optimization [...]
Liu Beyond heuristics: Applying alternating direction method of multiplier method in solving matrix factorization problems [...]
Li Maximum block improvement and polynomial optimization [...]
Nonsmooth optimization
H 1012Recent advances in optimization methods [...]
Bolte Forward-backward splitting and other descent methods for semi-algebraic minimization problems [...]
Beck The 2-coordinate descent method for solving double-sided simplex constrained minimization problems [...]
Teboulle Nonsmooth convex minimization: To smooth or not to smooth? [...]
Optimization in energy systems
MA 549Games, energy and investment [...]
Leclère The priority option: The value of being a leader in complete and incomplete markets [...]
Tan A splitting scheme for degenerate nonlinear PDEs: Application in an optimal hydropower management problem [...]
Ben Tahar Integration of an intermittent energy: A mean fields game approach [...]
MA 550Optimization in the oil \& natural gas industry [...]
Zubelli Evaluation of LNG contracts with cancellation options [...]
Foss Real-time production optimization based on decomposition techniques [...]
Flach An MIQP approach to the determination of analogous reservoirs [...]
PDE-constrained optimization & multi-level/multi-grid methods
MA 415Optimization applications in industry III [...]
Herzog Optimal control of elastoplastic processes [...]
Schiela An adaptive multilevel method for hyperthermia treatment planning [...]
Stingl Material optimization: From theory to practice [...]
Robust optimization
MA 004Applications of robust optimization III [...]
Cetinkaya Robust customized pricing [...]
Kawas A robust optimization approach to enhancing reliability in production planning under non-compliance risks [...]
Pietrasz Strategically robust investments on gas transmission networks [...]
Sparse optimization & compressed sensing
H 1028Algorithms for sparse optimization II [...]
Fountoulakis Matrix-free interior point method for compressed sensing problems [...]
Wang Linearized alternating direction methods for Dantzig selector [...]
Voronin Iteratively reweighted least squares methods for structured sparse regularization [...]
Stochastic optimization
MA 141Algorithms for stochastic optimization and approximation [...]
Kozmik Risk-averse stochastic dual dynamic programming [...]
Hübner Structure-exploiting parallel interior point method for multistage stochastic programs [...]
So Chance-constrained linear matrix inequalities with dependent perturbations: A safe tractable approximation approach [...]
MA 144Scheduling, control and moment problems [...]
von Haartman Probabilistic realization resource scheduler with active learning [...]
Hildenbrandt Partitions-requirements-matrices as optimal Markov kernels of special stochastic dynamic distance optimal partitioning problems [...]
Naumova Univariate discrete moment problem for new classes of objective function and its applications [...]
MA 376Risk aversion in stochastic combinatorial optimization [...]
Li Maximizing expected utility for stochastic combinatorial optimization problems [...]
Swamy Risk-averse stochastic optimization: Probabilistically-constrained models and algorithms for black-box distributions [...]
Othman Inventory-based versus prior-based options trading agents [...]
Telecommunications & networks
H 3002Network flows and network design [...]
Christensen Solving the piecewise linear network flow problem by branch-cut-and-price [...]
Fortz The hop-constrained survivable network design problem with reliable edges [...]
Amaldi Network routing subject to max-min fair flow allocation [...]
Variational analysis
H 2035Nonsmooth variational inequalities: Theory and algorithms [...]
Luke Constraint qualifications for nonconvex feasibility problems [...]
Sabach A first order method for finding minimal norm-like solutions of convex optimization problems [...]
Cherugondi A descent method for solving an equilibrium problem based on generalized D-gap function [...]
H 2051Quadratic and polynomial optimization [...]
Kim On ε-saddle point theorems for robust convex optimization problems [...]
Li Error bound for classes of polynomial systems and its applications: A variational analysis approach [...]

 

Sorted by cluster |  Room Mon | Tue | Wed | Thu | Fri
10:30 | 13:15 | 15:15 | any
  Online lending company provides a wide range of ways to get money by means of Tennessee Loans Online. In this section we give only a brief summary recommendation for admission of Levitra. Full information can be found in the instructions for receiving medications with vardenafil.