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

Friday, 15:15 - 16:45 h


Approximation & online algorithms
H 3010Routing and shortest paths [...]
Bonifaci Physarum can compute shortest paths [...]
Matuschke Approximation algorithms for capacitated location routing [...]
Sitters Metrical service systems and the generalized work function algorithm [...]
Combinatorial optimization
H 3004Packing, covering and domination II [...]
Pecher On the theta number of powers of cycle graphs [...]
Bianchi The disjunctive rank of the stable set polytope of web graphs [...]
Torres On the Chvátal-closure of the fractional set covering polyhedron of circulant matrices [...]
H 3005Nonlinear combinatorial optimization problems II [...]
Djeumou Fomeni A dynamic programming heuristic for the quadratic knapsack problem [...]
Hübner Ellipsoid bounds for convex quadratic integer programming [...]
Elloumi A unified view of linear and quadratic convex reformulation for binary quadratic programming [...]
H 3008Faster algorithms for network flow problems [...]
Nussbaum Multiple-source multiple-sink maximum flow in directed planar graphs in near-linear time [...]
Végh Concave generalized flows with applications to market equilibria [...]
H 3012Graph optimization problems in the streaming model [...]
Konrad On the order of graph streams [...]
Kliemann (1+1/k)-Approximate maximum matching in bipartite graph streams in O(k5) passes and improvements [...]
Zelke Algorithmic techniques for data stream computations [...]
H 3013Flows, cuts, and sparsifiers [...]
Harvey Graph sparsifiers [...]
Kelner Electrical flows, linear systems, and faster approximations of maximum flows, minimum s-t cuts, and multicommodity flows in undirected graphs [...]
Weibel When the cut condition is enough: Characterization of multiflow problems by forbidden minors [...]
Complementarity & variational inequalities
MA 313Contraction methods for separable convex optimization in the frame of VIs [...]
Gu Customized proximal point algorithms: A unified approach [...]
Tao A slightly changed alternating direction method of multipliers for separable convex programming [...]
Cai ADM based customized PPA for separable convex programming [...]
Conic programming
H 2036Algebraic geometry and conic programming III [...]
Uhler Maximum likelihood estimation in Gaussian graphical models from the perspective of convex algebraic geometry [...]
Theobald Containment problems for polytopes and spectrahedra [...]
H 2038Algebraic symmetry in semidefinite programming [...]
de Klerk Improved lower bounds on crossing numbers of graphs via semidefinite programming [...]
Eisenberg-Nagy Symmetry in RLT cuts for the quadratic assignment and standard quadratic optimization problems [...]
Gijswijt Symmetric semidefinite programs based on tuples [...]
Derivative-free & simulation-based optimization
H 3003ANovel applications of derivative-free and simulation-based optimization [...]
Meza Derivative-free optimization methods for determining the surface structure of nanosystems [...]
Conn Simulation-based optimization: Integrating seismic and production data in history matching [...]
Sartenaer Derivative-free optimization for large-scale nonlinear data assimilation problems [...]
Finance & economics
H 3021Optimization in financial markets [...]
Schoenmakers Multilevel primal and dual approaches for pricing American options [...]
Perkkiö Stochastic programs without duality gaps [...]
Becherer Optimal sparse portfolios in continuous time [...]
H 3027Decision making [...]
Villamil Modelling and simulation of social segmentation with individual and competitive parameters [...]
Hernández Ramírez The amplitude model and regret model in decision making under uncertainty [...]
Game theory
MA 005Learning and computation for game-theoretic problems [...]
Morrow Computing equilibria in regulated differentiated product market models [...]
Nedich A gossip algorithm for aggregative games on graphs [...]
MA 043Analysis of equilibria in noncooperative games [...]
Hoefer Contribution games in networks [...]
Harks Congestion games with variable demands [...]
de Jong Decentralized mechanisms for throughput scheduling [...]
Global optimization
H 0110Structural aspects of global optimization [...]
Still Minimization of nonconvex quadratic functions on special feasible sets [...]
Bajbar Nonsmooth versions of Sard's theorem [...]
Dorsch Local models in equilibrium optimization [...]
H 2053Advances in global optimization VI [...]
Yamada Global optimization methods utilizing partial separating hyperplanes for a canonical dc programming problem [...]
Diedam Global optimal control using direct multiple shooting [...]
Aloise A column generation algorithm for semi-supervised clustering [...]
Implementations & software
H 1058Parallel optimization software [...]
Fujisawa High-performance general solver for extremly large-scale semidefinite programming problems [...]
Shinano ParaSCIP and FiberSCIP - Parallel extensions of SCIP [...]
Phillips PICO's new hierarchical branch-and-bound system for massively parallel IP [...]
Integer & mixed-integer programming
H 2013Symmetry issues in integer programming [...]
Fischetti Orbital shrinking [...]
Pfetsch A computational comparison of symmetry handling methods in integer programming [...]
Ostrowski Dominance-strengthened symmetry breaking constraints in the unit commitment problem [...]
H 2032Integer points in polytopes II [...]
Nill Recent developments in the geometry of numbers of lattice polytopes [...]
Paffenholz Permutation polytopes [...]
Kasprzyk Riemannian polytopes [...]
H 2033Decomposition methods and applications [...]
Naoum-Sawaya A Benders decomposition approach for the critical node selection problem [...]
Celebi An approximation algorithm for Benders decomposition of variational inequality problems [...]
Akartunali Radiation treatment planning for volumetric modulated arc therapy (VMAT): Optimization and heuristics [...]
Life sciences & healthcare
MA 376Methods from discrete mathematics in systems biology [...]
Jegelka On fast approximate submodular minimization and related problems [...]
Roualdes Non-parametric species delimitation based on branching rates [...]
Felici Logic data mining in the presence of noisy data [...]
Logistics, traffic, and transportation
H 0106Inventory routing [...]
Shiina Inventory distribution problem under uncertainty [...]
MA 042Applications of supply chain [...]
Mirzazadeh A bi-criteria inventory model under stochastic environment with considering perishable costs [...]
Waldherr Two-stage order sequence planning in shelf-board production [...]
Wei Understanding the performance of the long chain and sparse designs in process flexibility [...]
Mixed-integer nonlinear programming
MA 041Modelling, reformulation and solution of MINLPs [...]
de Santis A method for MINLP problems with simple constraints [...]
Liberti On feasibility-based bounds tightening [...]
D'Ambrosio Optimistic modeling of non-linear optimization problems by mixed-integer linear programming [...]
Multi-objective optimization
H 1029Optimality conditions in multiobjective optimization [...]
Zhang Efficiency conditions for semi-infinite multiobjective optimization problems [...]
Khan On a Convex Optimization Problem in Predicting Tumor Location [...]
Jadamba Regularization of stochastic variational inequalities and comparison of an Lp and a sample-path approach for network problems [...]
Nonlinear programming
H 0107Decomposition and relaxation methods [...]
Louveaux Relaxation schemes for the evaluation of a policy in batch mode reinforcement learning [...]
Burdakov An approach to solving decomposable optimization problems with coupling constraints [...]
H 0112Optimality conditions II [...]
Naffouti On the second order optimality conditions for optimization problems with inequality constraints [...]
Strekalovskiy New mathematical tools for new optimization problems [...]
MA 004Fast gradient methods for nonlinear optimization and applications II [...]
Liu Max-min fairness linear transceiver design for a multi-user MIMO interference channel [...]
Hager A primal-dual active set algorithm for nonlinear optimization with polyhedral constraints [...]
Dai A perfect example for the BFGS method [...]
Optimization in energy systems
MA 549Stochastic equilibria in energy markets II [...]
Ralph Risk averse long term capacity equilibria: An optimization formulation extending MARKAL [...]
Ozdemir Generation capacity investments in electricity markets: Perfect competition [...]
Luna Finding equilibrium prices for energy markets with clearing conditions [...]
MA 550MPEC problems and market coupling [...]
Cornélusse Coupling European day-ahead electricity markets with COSMOS [...]
Müller Linear clearing prices in non-convex european day-ahead electricity markets [...]
Huppmann Approximating unit commitment using mathematical programming under equilibrium constraints [...]
PDE-constrained optimization & multi-level/multi-grid methods
H 0111Preconditioning in PDE constrained optimization [...]
Kollmann Robust iterative solvers for a class of PDE-constrained optimization problems [...]
Pearson Iterative solution techniques for Stokes and Navier-Stokes control problems [...]
Sachs Reduced order models in preconditioning techniques [...]
MA 415PDE constrained optimization with uncertain data [...]
Tiesler Stochastic collocation for optimal control problems with stochastic PDE constraints [...]
Schillings On the influence of robustness measures on shape optimization with stochastic uncertainties [...]
Heinkenschloss A trust-region based adaptive stochastic collocation method for PDE constrained optimization with uncertain coefficients [...]
Stochastic optimization
MA 141Scenario generation in stochastic programming [...]
Mehrotra New results in scenario generation for stochastic optimization problems via the sparse grid method [...]
Homem-De-Mello On scenario generation methods for a hydroelectric power system [...]
MA 144PDE constrained stochastic optimization [...]
Schultz Shape optimization under uncertainty via stochastic optimization [...]
Geihe A two-scale approach for risk averse shape optimization [...]
Huschto Solving stochastic optimal control problems by a polynomial chaos approach [...]
Telecommunications & networks
H 3503Robust network design and applications [...]
Agra The robust vehicle routing problem with time windows [...]
Mattia The robust network loading problem [...]
D'Andreagiovanni On the adoption of multi-band uncertainty in robust network design [...]
Variational analysis
H 2051Monotone operators [...]
Bot Approaching the maximal monotonicity of bifunctions via representative functions [...]
Rocco On a surjectivity-type property of maximal monotone operators [...]
László Regularity conditions for the maximal monotonicity of the generalized parallel sum [...]


Sorted by cluster |  Room Mon | Tue | Wed | Thu | Fri
10:30 | 13:15 | 15:15 | any
  The system of instant Virginia Loans Online allows any adult U.S. citizen. Thanks to that, they have a great variety of drugs that can help in these cases. Female Viagra is not an exception.