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

Thursday, 10:30 - 12:00 h

 

Approximation & online algorithms
H 3010Approximation algorithms [...]
Williamson A dual-fitting 3⁄2-approximation algorithm for some minimum-cost graph problems [...]
Kolliopoulos Planar disjoint-paths completion [...]
Kakimura Computing knapsack solutions with cardinality robustness [...]
Combinatorial optimization
H 3004Optimization and enumeration [...]
Ossona de Mendez Large structured induced subgraphs with close homomorphism statistics [...]
Chertkov Computing the permanent with belief propagation [...]
Coja-Oghlan Catching the k-NAESAT threshold [...]
H 3005Robust network design [...]
Kutschka Robust metric inequalities for network design under demand uncertainty [...]
Schmidt Single commodity robust network design: Models and algorithms [...]
Sanità Steiner tree approximation via iterative randomized rounding [...]
H 3008Resource placement in networks [...]
Johnson Disjoint path facility location: Theory and practice [...]
Applegate Using an exponential potential function method to optimize video-on-demand content placement [...]
H 3012Exact algorithms for hard problems [...]
Carbonneau Globally optimal clusterwise regression by branch and bound optimization with heuristics, sequencing and ending subset [...]
Fügenschuh LP and SDP branch-and-cut algorithms for the minimum graph bisection problem: A computational comparison [...]
Cerveira A two-stage branch and bound algorithm to solve truss topology design problems [...]
H 3013Combinatorial optimization in railways II [...]
Hansmann Minimal shunting operations for freight train composition [...]
Bärmann Approximate robust optimization and applications in railway network expansion [...]
Klug An approach for solving the freight train routing problem [...]
H 3021Smoothed analysis of algorithms [...]
Brunsch Improved smoothed analysis of multiobjective optimization [...]
Plociennik A probabilistic PTAS for shortest common superstring [...]
Complementarity & variational inequalities
MA 313Bilevel programs and MPECs [...]
Ding First order optimality conditions for mathematical programs with semidefinite cone complementarity constraints [...]
Dempe Optimality conditions for bilevel programming problems [...]
Ye On solving bilevel programs with a nonconvex lower level program [...]
Conic programming
H 2036Linear programming: Theory and algorithms [...]
Tits The power of constraint reduction in interior-point methods [...]
Abdessamad Strict quasi-concavity and the differential barrier property of gauges in linear programming [...]
Kitahara A proof by the simplex method for the diameter of a (0,1)-polytope [...]
H 2038New results in copositive and semidefinite optimization [...]
Ahmed On connections between copositive programming and semi-infinite programming [...]
Jargalsaikhan Conic programming: Genericity results and order of minimizers [...]
Gijben Scaling relationship between the copositive cone and Parrilo's first level approximation [...]
Constraint programming
H 3003AInstance-specific tuning, selection, and scheduling of solvers [...]
Sellmann Solver portfolios [...]
Malitsky Instance-specific algorithm configuration [...]
Xu Evaluating component solver contributions to portfolio-based algorithm selectors [...]
Finance & economics
H 3027Risk management in financial markets [...]
Tsoukalas Dynamic portfolio execution [...]
Feinstein Set-valued dynamic risk measures [...]
Gupta A data-driven approach to risk preferences [...]
Game theory
MA 005Mechanisms for resource allocation problems [...]
Ventre Using lotteries to approximate the optimal revenue [...]
Markakis On worst-case allocations in the presence of indivisible goods [...]
Kovacs Characterizing anonymous scheduling mechanisms for two tasks [...]
MA 043Mean-field approaches to large scale dynamic auctions and mechanisms [...]
Iyer Mean field equilibria of dynamic auctions with learning [...]
Balseiro Auctions for online display advertising exchanges: Approximations and design [...]
Proutiere Optimal bidding strategies and equilibria in repeated auctions with budget constraints [...]
Global optimization
H 2053Advances in global optimization I [...]
Carrizosa Location on networks. Global optimization problems [...]
Burai Necessary and sufficient condition on global optimality without convexity and second order differentiability [...]
Implementations & software
H 0110Commercial mathematical programming solvers II [...]
Mittelmann Selected benchmarks in continuous and discrete optimization [...]
Dahl Extending the conic optimizer in MOSEK with semidefinite cones [...]
Bixby Presolve for linear and mixed-integer programming [...]
H 1058Modeling languages and software I [...]
Siirola Modeling and optimizing block-composable mathematical programs in Pyomo [...]
Sagnol PICOS: A python interface to conic optimization solvers [...]
Fourer Strategies for using algebraic modeling languages to formulate second-order cone programs [...]
Integer & mixed-integer programming
H 2013Polyhedral combinatorics [...]
Delle Donne Vertex coloring polytopes over trees and block graphs [...]
Forte Formulations and exact solution algorithms for the minimum two-connected dominating set problem [...]
H 2032Branch-and-price II: Column and row generation [...]
Bulbul Simultaneous column-and-row generation for large-scale linear programs with column-dependent-rows [...]
Munari Using interior point methods in branch-price-and-cut framework [...]
Sadykov Column generation for extended formulations [...]
H 2033New developments in integer programming [...]
Dadush Convex minimization over the integers [...]
Regts Polyhedra with the integer Carathéodory property [...]
Dunkel A refined Gomory-Chvatal closure for polytopes in the unit cube [...]
Life sciences & healthcare
MA 376Life sciences and healthcare "à la Clermontoise" [...]
Barra Assessing functional brain connectivity changes in cognitive aging using RS-fMRI and graph theory [...]
Mephu Nguifo Stability measurement of motif extraction methods from protein sequences in classification tasks [...]
Pogorelcnik Clique separator decomposition and applications to biological data [...]
Logistics, traffic, and transportation
H 0106Analysis of decentralized network systems [...]
Saban The competitive facility location game: Equilibria and relations to the 1-median problem [...]
Gui A robustness analysis of a capacity exchange mechanism in multicommodity networks under demand uncertainty [...]
Fearing Managing air traffic disruptions through strategic prioritization [...]
Mixed-integer nonlinear programming
MA 041Techniques for convex MINLPs [...]
Bonami On disjunctive cuts for mixed integer convex programs [...]
Mahajan Algorithms for solving convex MINLPs with MINOTAUR [...]
Miller Valid inequalities for a nonseparable quadratic set [...]
MA 042MINLP theory and algorithms [...]
Traversi Separable underestimators for quadratic combinatorial optimization [...]
Coniglio Spatial branch-and-bound for nonconvex Euclidean norm constrained mathematical programs [...]
Multi-objective optimization
H 1029Vector optimization [...]
Hernández-Jiménez Characterization of efficient solutions for non-regular multiobjective problemas with inequality-type constraints [...]
Gutiérrez Approximation of efficient sets via ε-efficient sets [...]
Flores-Bazán Efficiency and ordering variational principles [...]
Nonlinear programming
H 0107Linear algebra for optimization [...]
Stoll Preconditioning for time-dependent PDE-constrained optimization problems [...]
Akle Preconditioning for iterative computation of search directions within interior methods for constrained optimization [...]
Orban Spectral analysis of matrices arising in regularized interior-point methods [...]
H 0112Convex nonlinear optimization I [...]
Stefanov Convex separable minimization with box constraints [...]
Perumal A decomposition technique for convex optimization problems [...]
Nonsmooth optimization
H 1012Nonsmooth optimization theory [...]
Wickström Generalized derivatives of the projection onto the cone of positive semidefinite matrices [...]
Zemkoho Optimization problems with value function objectives [...]
Huyer Minimizing functions containing absolute values of variables [...]
Optimization in energy systems
MA 549Capacity of gas transport networks [...]
Hayn Optimal allocation of capacities in gas networks [...]
Schewe Mixed-integer-programming methods for gas network optimization [...]
Hiller An automated method for the booking validation problem [...]
MA 550Gas and electricity networks [...]
Schwarz Gas network design with integrated optimization of topology and dimensioning [...]
Mckinnon An MINLP approach to islanding electricity networks [...]
PDE-constrained optimization & multi-level/multi-grid methods
H 0111PDE optimization in medicine I [...]
Fernandez Optimizing a chemotherapy model for brain tumors by using PDE [...]
Schwen Modeling flow through realistic, algorithmically generated vascular structures in the liver [...]
Lubkoll Optimal control in implant shape design [...]
MA 415Optimization applications in industry VI [...]
Hömberg Optimal control of multiphase steel production [...]
Vossen Optimization and model reduction methods for heat source determination in welding [...]
Kostina Optimization methods for nonlinear model predictive control of non-stationary partial differential equations [...]
Robust optimization
MA 004Robust optimization, estimation and machine learninig [...]
Shtern A robust optimization approach for tracking under bounded uncertainty [...]
Hazan Sublinear optimization for machine learning [...]
Bhattacharyya Making SVM Classifiers robust to uncertainty in kernel matrices [...]
Sparse optimization & compressed sensing
H 1028Computable bounds for sparse recovery [...]
d'Aspremont High-dimensional geometry, sparse statistics and optimization [...]
Kilinc Karzan Verifiable sufficient conditions for l1-recovery of sparse signals [...]
Juditsky Accuracy guaranties and optimal l1-recovery of sparse signals [...]
Stochastic optimization
MA 141High dimensional statistics: Techniques from stochastic and robust optimization [...]
Rigollet Deviation optimal model selection using greedy algorithms [...]
Mannor Robust sparse regression and orthogonal matching pursuit [...]
Sanghavi Learning the graph of network cascades [...]
MA 144Decomposition methods for multistage stochastic programs [...]
Guigues Sampling-based decomposition methods for multistage stochastic programs based on extended polyhedral risk measures [...]
Tekaya Risk neutral and risk averse stochastic dual dynamic programming method [...]
Sen Multi-stage stochastic decomposition [...]
Telecommunications & networks
H 3002Networks in production, logistics and transport [...]
Büttner Online network routing amongst unknown obstacles [...]
Werth Bottleneck routing games [...]
Bender Online delay management: Beyond competitive analysis [...]
H 3503Allocation problems [...]
Gullhav Service deployment in cloud data centers regarding quality of service (QoS) requirements [...]
Garg Heuristic mathematical models for solving dynamic task assignment problem in distributed real time systems [...]
Variational analysis
H 2035Structure and stability of optimization problems [...]
Ruckmann Max-type objective functions: A smoothing procedure and strongly stable stationary points [...]
Gfrerer Second-order conditions for a class of nonsmooth programs [...]
Fusek On metric regularity of the Kojima function in nonlinear semidefinite programming [...]
H 2051Optimization methods for nonsmooth inverse problems in PDEs [...]
Kaltenbacher Iterative regularization of parameter identification in PDEs in a Banach space framework [...]
Hofmann On smoothness concepts in regularization [...]
Clason Inverse problems for PDEs with uniform noise [...]

 

Sorted by cluster |  Room Mon | Tue | Wed | Thu | Fri
10:30 | 13:15 | 15:15 | any
  Today, Ohio Loans Online are legitimate, but there are illegal transactions that are still on the rise. There are also a lot of other privileges for return customers. Men buy Viagra Gold online not to wait till the lucky event happens but to enjoy each sex act because Viagra effect lasts up to 36 hours!