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, 10:30 - 12:00 h

 

Special sessions
MA 041Tucker session [...]
Presentation by Tucker Prize Finalist #1 [...]
Presentation by Tucker Prize Finalist #2 [...]
Presentation by Tucker Prize Finalist #3 [...]
Approximation & online algorithms
H 3010Approximation in routing and others [...]
An Improving Christofides' algorithm for the s-t path TSP [...]
Schalekamp On the integrality gap of the subtour LP for the 1,2-TSP [...]
Shmoys A primal-dual approximation algorithm for min-sum single-machine scheduling problems [...]
Combinatorial optimization
H 3004Combinatorial optimization in chip design I [...]
Markov A primal-dual Lagrange optimization for VLSI global placement [...]
Struzyna Quadratic and constrained placement in chip design: Global flows and local realizations [...]
Brenner Fractional versus integral flows: A new approach to VLSI legalization [...]
H 3005Triangulations [...]
Pournin The flip-graph of the 4-dimensional cube is connected [...]
Schmiedl Gromov-Hausdorff distance of finite metric spaces [...]
H 3008Rational convex programs and combinatorial algorithms for solving them [...]
Goel A perfect price discrimination market model, and a rational convex program for it [...]
Vazirani Rational convex programs [...]
Jain Eisenberg-Gale markets: Algorithms and game theoretic properties [...]
H 3012Matching [...]
Knust Scheduling sports tournaments on a single court based on special 2-factorizations [...]
Takamatsu Matching problems with delta-matroid constraints [...]
Kapralov On the communication and streaming complexity of maximum bipartite matching [...]
H 3013Combinatorial optimization in railways I [...]
Imaizumi A column generation approach for crew rostering problem in a freight railway company in Japan [...]
Schlechte Recent developments in railway track allocation [...]
Weider A rapid branching method for the vehicle rotation planning problem [...]
H 3021Scheduling algorithms I [...]
Pruhs Online primal-dual for non-linear optimization with applications to speed scaling [...]
Svensson On the hardness of scheduling with precedence constraints to minimize makespan [...]
Stein How to schedule when you have to buy your energy [...]
Complementarity & variational inequalities
MA 313Optimization and equilibrium models in energy systems [...]
Gabriel A new method for MPECs with a natural gas application [...]
Fan A stochastic variational inequality model for estimating traffic demand based on random link flow observations [...]
Bai Biofuel supply chain design under competitive agricultural land use and feedstock market equilibrium [...]
Conic programming
H 2036Geometry and duality in convex programming [...]
Waki Computation of facial reduction algorithm [...]
Roshchina Partition and complementarity in multifold conic systems [...]
Guler Efficient first-order methods for convex programming [...]
H 2038Applications of semidefinite optimization [...]
Hungerländer Semidefinite optimization approaches to some facility layout problems [...]
Vieira Relationships between minimal unsatisfiable subformulas and semidefinite certificates of infeasibility [...]
Constraint programming
H 3003AConstraint-based scheduling [...]
Cire MDD propagation for disjunctive scheduling [...]
Laborie Conditional interval variables: A powerful concept for modeling and solving complex scheduling problems [...]
Finance & economics
H 3027Applications of stochastic programming to finance and insurance [...]
Consiglio Convex lower bounding to generate multi-asset, arbitrage-free, scenario trees [...]
Gulpinar Robust investment decisions for asset liability management [...]
Consigli Institutional asset-liability management for a large P&C insurance company [...]
Game theory
MA 043Games in networks [...]
Elliott A network centrality approach to coalitional stability [...]
Bimpikis Competitive marketing strategies over social networks [...]
Global optimization
H 2053Optimization models and methods for computer vision [...]
Kolmogorov Message passing algorithms for MAP-MRF inference [...]
Cremers Convex relaxation techniques with applications in computer vision [...]
Collins Random walks based multi-image segmentation: Quasiconvexity results and GPU-based solutions [...]
Implementations & software
H 1058Testing environments for machine learning and compressed sensing [...]
Friedlander Spot: A linear-operator toolbox for Matlab [...]
Scheinberg Studying effects of various step selection strategies in first order approaches to compressed sensing and other composite optimization problems [...]
Lorenz Constructing test instances for basis pursuit denoising [...]
Integer & mixed-integer programming
H 2013Column generation and decomposition [...]
Ozpeynirci Allocation of proposals to reviewers to facilitate effective ranking: A branch and price approach [...]
Lusby A column generation approach for solving the patient admission scheduling problem [...]
H 2032Integer programming algorithms I [...]
Dang A fixed-point iterative approach to integer programming and distributed computation [...]
Rehn Exploiting symmetry in integer convex optimization using core points [...]
Oertel Convex integer minimization in fixed dimension [...]
MA 004Advances in integer programming [...]
Deza Combinatorial, computational, and geometric approaches to the colourful simplicial depth [...]
Puerto Ordered weighted average optimization of combinatorial problems [...]
Köppe A discretization-free FPTAS for polynomial optimization over the mixed-integer points in a class of polytopes of varying dimension [...]
MA 042Recent progress in MIP [...]
Molinaro Strength of cross cuts [...]
Dash On t-branch split cuts for mixed-integer programs [...]
Balas Cut generating points on the boundary of a lattice-free convex set [...]
Life sciences & healthcare
H 2033Computational genomics [...]
Richard Fiona: Automatic correction of sequencing errors in genome sequencing experiments [...]
D'Addario DNA sequence design [...]
Hajirasouliha Next-generation sequence characterization of complex genome structural variation. [...]
Logistics, traffic, and transportation
H 0106Facility location and p-median problems [...]
Garcia Quiles On the p-median problem with uncertainty in the cost matrix [...]
Xavier Solving the Fermat-Weber location problem by the hyperbolic smoothing approach [...]
Sural The dynamic p-median problem with relocation [...]
H 0111Supply chain optimization [...]
Geunes Multi-period price promotions in a single-supplier, multi-retailer supply chain under asymmetric demand information [...]
Romero Morales A multi-objective economic lot-sizing problem with environmental considerations [...]
Strinka Approximation algorithms for risk-averse selective newsvendor problems [...]
Mixed-integer nonlinear programming
MA 005Global mixed-integer nonlinear optimization I [...]
Grossmann Using convex nonlinear relaxations in the global optimization of nonconvex generalized disjunctive programs [...]
Bogataj A multilevel approach to global optimization of MINLP problems [...]
Westerlund A reformulation framework for global optimization [...]
Multi-objective optimization
H 1029Linear and integer multiobjective optimization [...]
Kallio Reference point method for multi-criteria optimization with integer variables [...]
Ehrgott A multi-objective linear programming approach to data envelopment analysis [...]
Nonlinear programming
H 0107Methods for nonlinear optimization I [...]
Liu How does the linear independence assumption affect algorithms of nonlinear constrained optimization [...]
Mommer A nonlinear preconditioner for experimental design problems [...]
Dussault The behaviour of numerical algorithms without constraint qualifications [...]
H 0110Nonlinear optimization I [...]
Eckstein Alternating direction methods and relative error criteria for augmented Lagrangians [...]
Chin A family of second order methods for L1 convex optimization [...]
Solntsev Dynamic batch methods for L1 regularized problems and constrained optimization [...]
H 0112Algorithms for optimal control I [...]
Janka Separable formulations of optimum experimental design problems [...]
Hatz Hierarchical dynamic optimization - Numerical methods and computational results for estimating parameters in optimal control problems [...]
Gräser Truncated nonsmooth newton multigrid methods for nonsmooth minimization [...]
Nonsmooth optimization
H 1012Iterative methods for variational analysis [...]
Jean-Alexis The second order generalized derivative and generalized equations [...]
Baier Set-valued Newton's method for computing convex invariant sets [...]
Farkhi The directed subdifferential and applications [...]
Optimization in energy systems
MA 549Optimization models to manage risk and uncertainty in power systems operations [...]
Street Energy and reserve scheduling under a joint GT n-K security criterion: An adjustable robust optimization approach [...]
Zhao Adaptive robust optimization for the security constrained unit commitment problem [...]
Papavasiliou Applying high performance computing to multi area stochastic unit commitment for high wind penetration [...]
MA 550Unit commitment and inventory problems [...]
Koc Parallel branch-cut-price for solving multistage stochastic unit commitment problems [...]
Lai A stochastic approach to power inventory optimization [...]
Schulze Decomposition methods for stochastic unit commitment [...]
PDE-constrained optimization & multi-level/multi-grid methods
MA 415Applications of PDE-constrained optimization [...]
Pinnau Exploiting model hierarchies in space mapping optimization [...]
Ulbrich An adaptive semismooth Newton-CG method for constrained parameter identification in seismic tomography [...]
Robust optimization
H 3503Extensions of robust optimization models [...]
Todd A robust robust (sic) optimization result [...]
Pfeuffer An extension of the controlled robustness model of Bertsimas and Sim [...]
Sparse optimization & compressed sensing
H 1028New models and algorithms in sparse optimization [...]
Boumal Riemannian algorithms and estimation bounds for synchronization of rotations [...]
Davenport A simple framework for analog compressive sensing [...]
Recht Atomic norm denoising with applications to spectrum estimation and system identification [...]
Stochastic optimization
MA 141Advances in stochastic optimization [...]
Brown Optimal sequential exploration: Bandits, clairvoyants, and wildcats [...]
Moallemi Pathwise optimization for linear convex systems [...]
Caramanis Optimization at all levels: Probabilistic Envelope Constraints [...]
MA 144Optimization of physical systems under uncertainty [...]
Zavala Stochastic optimization: Impacts on electricity markets and operations [...]
Pagnoncelli The optimal harvesting problem under risk aversion [...]
Luedtke Branch-and-cut approaches for chance-constrained formulations of reliable network design problems [...]
MA 376Decisions policies and estimation techniques in a stochastic environment [...]
Haensel A SP approach for decision-dependent uncertainty in production planning under non-compliance risk [...]
Bastin On the combination of Hessian approximations for data estimation [...]
Yang Approximate dynamic programming with Bézier curves/surfaces for top-percentile traffic routing [...]
Telecommunications & networks
H 3002Optical access networks [...]
Hervet Robust optimization of optical fiber access networks deployments [...]
Lopes Modelling the minimum cost PON access network design problem [...]
Maurer Lagrangian approaches to a two-level FTTX network design problem [...]
Variational analysis
H 2035Nonsmooth phenomena in optimal control [...]
Meyer Boundary control of the obstacle problem [...]
Gerdts Globalized semi-smooth Newton methods in optimal control problems with DAEs [...]
Schmidt Properties of the optimal value function and application to worst-case robust optimal control problems [...]
H 2051Equilibrium problems and related topics [...]
Ferreira Local convergence of Newton's method under majorant condition in Riemannian manifolds [...]
Scheimberg A reflection-projection method for equilibrium problems [...]
Drummond New strategies for vector optimization problems [...]

 

Monday, 13:15 - 14:45 h

 

Approximation & online algorithms
H 3010Real-time scheduling [...]
Niemeier Scheduling with an orthogonal resource constraint [...]
van der Ster Mixed-criticality scheduling of sporadic task systems on a single machine [...]
Chen Resource augmentation in real-time systems [...]
Combinatorial optimization
H 3004Combinatorial optimization in chip design II [...]
Suhl Lagrangian relaxation and quadratic minimum cost flows for gate sizing [...]
Bartoschek Fast buffering of repeater trees [...]
Held Delay bounded Steiner trees and time-cost tradeoffs for faster chips [...]
H 3005Structural graph theory and methods [...]
Oum Vertex-minors and pivot-minors of graphs [...]
Joret Excluded forest minors and the Erdös-Pósa Property [...]
Norine Pairs of disjoint cycles [...]
H 3008Discrete structures and algorithms I [...]
Kijima Efficient randomized rounding in permutahedron [...]
Pap Characterizing and recognizing generalized polymatroids [...]
Massberg Dual consistency and cardinality constrained polytopes [...]
H 3012Scheduling I [...]
Steiner Scheduling and the traveling salesman problem on permuted monge matrices [...]
Rieger Two variants of flexible job shop scheduling with blockages [...]
Stougie Scheduling with job-splitting and fixed setup [...]
H 3013Recoverable robust combinatorial optimization [...]
Büsing k-distance recoverable robustness [...]
Koster The recoverable robust knapsack problem [...]
H 3021Scheduling algorithms II [...]
Rutten Scheduling sporadic tasks on unrelated parallel machines [...]
Wiese A new approach to online scheduling: Approximating the optimal competitive ratio [...]
Megow Nearly optimal universal solutions for knapsack and sequencing on an unreliable machine [...]
Complementarity & variational inequalities
MA 041Game theoretic analysis and optimization for resource allocation in communication systems [...]
Stanczak Progress and challenges in decentralized resource allocation optimization [...]
Luo Linear precoder optimization and base station selection for heterogeneous networks [...]
Scutari Monotone communication games [...]
MA 313Optimization and equilibrium problems I [...]
Stein On differentiability properties of player convex generalized Nash equilibrium problems [...]
Schwartz Biased lottery versus all-pay auction contests: A revenue dominance theorem [...]
Ferris Stochastic variational inequalities and MOPEC [...]
Conic programming
H 2036Algorithms for matrix optimization problems [...]
Li Sequential semismooth Newton method for nearest low-rank correlation matrix problem [...]
Wang On how to solve large scale matrix log-determinant optimization problems [...]
Xia Gradient methods for a general least squares problem [...]
H 2038Nonlinear semidefinite programs and copositive programs [...]
Kocvara Introducing PENLAB, a Matlab code for nonlinear conic optimization [...]
Dür Remarks on copositive plus matrices and the copositive plus completion problem [...]
Dickinson Considering the complexity of complete positivity using the Ellipsoid method [...]
Constraint programming
H 3003AImproved representations for constraint programming [...]
Pelleau Octagonal domains for constraint programming [...]
Finance & economics
H 3027New developments in computational finance [...]
Coleman On the use of automatic differentiation to efficiently determine first and second derivatives in financial applications [...]
Fonseca Robust value-at-risk with linear policies [...]
Reisinger The effect of the payoff on the penalty approximation of American options [...]
Game theory
MA 043Large games and networks: Control and approachability [...]
Malhame Nash equilibria in radial communication networks via mean field game theory [...]
Como Stability analysis of transportation networks with multiscale driver decisions [...]
Bauso Time-averaged consensus and distributed approachability in large multi-agent networks [...]
Global optimization
H 2053Global optimization: Algorithms and applications [...]
Rebennack Good linear approximations for MINLP Problems with tolerance guarantee [...]
Prokopyev Optimal design of the annual influenza vaccine with autonomous manufacturer [...]
Zhupanska A nonlinear semidefinite programming approach to design of materials [...]
Implementations & software
H 1058Optimization tools for R [...]
Friberg The R-to-MOSEK optimization interface [...]
Theußl ROI - R Optimization Infrastructure package [...]
Dirkse GDXRRW: Exchanging data between GAMS and R [...]
Integer & mixed-integer programming
H 2013MILP formulations I [...]
Mclay A mixed-integer programming model for enforcing priority list policies in Markov decision processes [...]
de Araujo Lagrange heuristic for a reformulated capacitated lot sizing problem in parallel machines [...]
H 2032Integer programming algorithms II [...]
Williams The general solution of a mixed integer programme [...]
Gueye Using distance variables for the quadratic assignment problem [...]
MA 004New methodologies for mixed-integer programming [...]
Vielma Split cuts for convex nonlinear mixed integer programming [...]
Bienstock Strong formulations for convex functions over nonconvex sets [...]
Moran Strong dual for conic mixed-integer programs [...]
MA 042Computational integer programming [...]
Steffy Improving the accuracy of linear programming solvers with iterative refinement [...]
Wesselmann Computational experiments with general-purpose cutting planes [...]
Espinoza Cutting and separation for semi-continuous variables [...]
Life sciences & healthcare
H 2033Evolution and phylogenetics [...]
Scornavacca Constructing minimal phylogenetic networks from softwired clusters is fixed parameter tractable [...]
Kelk Cycle killer … {} qu'est-ce que c'est? On the comparative approximability of hybridization number and directed feedback vertex set [...]
Fischer When sets of species make an evolutionary tree unique [...]
Logistics, traffic, and transportation
H 0106Branch-and-price algorithms in transportation [...]
Voll Branch-and-price-and-cut for railroad blocking plans [...]
Seixas Branch-and-price for a rich vehicle routing and scheduling problem [...]
Bohlin An extended formulation for allocating classification tracks in hump yards [...]
H 0111Advances in machine learning [...]
Grigas Proximal subgradient and dual averaging for sequential decision-making and non-smooth optimization [...]
Farias Non-parametric approximate dynamic programming via the kernel method [...]
Negahban Noisy matrix decomposition via convex relaxation: Optimal rates in high dimensions [...]
Mixed-integer nonlinear programming
MA 005Global mixed-integer nonlinear optimization II [...]
Knudsen Mixed integer optimization of the late-life performance of shale-gas wells [...]
Guillén-Gosálbez Solving mixed-integer linear-fractional programming problems via an exact MILP reformulation [...]
Castro Multiparametric disaggregation as a new paradigm for global optimization of mixed-integer polynomial programs [...]
Multi-objective optimization
H 1029Efficient set representations [...]
Stiglmayr The multicriteria linear bottleneck assignment problem [...]
Paquete Concise representation of nondominated sets in discrete multicriteria optimization [...]
Seipp A polynomial time approach for the multiple objective minimum spanning tree problem [...]
Nonlinear programming
H 0107Methods for nonlinear optimization II [...]
Gorka Parallel direction finding algorithm in method of feasible directions [...]
Hungerford Edge directions in polyhedral optimization [...]
Zsolt Pros and cons of first order methods for solving general nonlinear problems [...]
H 0110Nonlinear optimization II [...]
Robinson A primal-dual active-set method for convex QP [...]
Leyffer Large-scale nonlinear optimization solvers [...]
Wong Regularized quadratic programming methods for large-scale SQP [...]
H 0112Structures, complexities, and eigenvalues of tensor forms and polynomial functions [...]
Zhang Cones of nonnegative quartic polynomial functions and their applications [...]
Lim 3-tensors as the boundary of tractability [...]
Yang Some properties of tensors’ eigenvalues and related optimization problem [...]
Nonsmooth optimization
H 1012Constrained variational inequalities: Approximation and numerical resolution [...]
Peypouquet Lagrangian-penalization algorithm for constrained optimization and variational inequalities [...]
Garcia Ramos Representable monotone operators and limits of sequences of maximal monotone operators [...]
Alvarez A strictly feasible Bundle method for solving convex nondifferentiable minimization problems under second-order constraints [...]
Optimization in energy systems
MA 549Optimization in energy systems [...]
Nadarajah Approximate linear programming relaxations for commodity storage real option management [...]
Lohmann Stochastic hydro-thermal scheduling with CVaR risk constraints in deregulated markets [...]
Guan A branch-and-cut algorithm for the Multi-stage Stochastic Unit Commitment Problem [...]
MA 550Network operation under failures and losses [...]
Chen Survivability-constrained generation unit commitment with post-contingency corrective recourse [...]
Canto dos Santos New genetic algorithms for contingencies selection in electric power systems [...]
Evaldt Optimal allocation of equipment for monitoring and identification of commercial losses in distribution networks [...]
PDE-constrained optimization & multi-level/multi-grid methods
MA 415Iterative solution of PDE constrained optimization and subproblems [...]
Zhlobich Multilevel quasiseparable matrices in PDE-constrained optimization [...]
Kriwet Covariance matrix computation for parameter estimation in nonlinear models solved by iterative linear algebra methods [...]
Lehmann Optimal sequencing of primal, adjoint and design steps. [...]
Robust optimization
H 3503Robust nonlinear optimization [...]
Mevissen Distributionally robust optimization for polynomial optimization problems [...]
Pirnay An algorithm for robust optimization of nonlinear dynamic systems [...]
Fleischman On the trade-off between robustness and value [...]
Sparse optimization & compressed sensing
H 1028Sparse optimization and generalized sparsity models [...]
Saab Recovering compressively sampled signals using partial support information [...]
Candes PhaseLift: Exact phase retrieval via convex programming [...]
Kutyniok Clustered sparsity [...]
Stochastic optimization
MA 141Applications in natural resources [...]
Danzan Regional economical mathematical models considering ecological factors [...]
Lenz Optimization of water network operation under uncertainties [...]
Piazza The optimal harvesting problem under price uncertainty [...]
MA 144Production, inventory and project management [...]
Huang Optimal aggregate production planning with fuzzy data [...]
Randa Static-dynamic uncertainty strategy for a single-item stochastic inventory control problem [...]
Hasuike Risk control approach to critical path method in mathematical programming under uncertainty [...]
MA 376Stochastic mixed-integer programming [...]
Evers The orienteering problem under uncertainty: Robust optimization and stochastic programming compared [...]
Romeijnders On the performance of a class of convex approximations for integer recourse models [...]
Kucukyavuz Decomposition algorithms with Gomory cuts for two-stage stochastic integer programs [...]
Telecommunications & networks
H 3002Wireless networks [...]
Astrakov The full efficient monitoring of stripe with external deployment sensors [...]
Nigam A Lagrangian heuristic for delay constrained relay node placement problem in wireless sensor networks [...]
Berger Constrained resource assignments: Fast algorithms and applications in wireless networks [...]
Variational analysis
H 2035Eigenvalue and semi-infinite optimization [...]
Grundel Variational analysis of the spectral abscissa for defective and derogatory matrices [...]
Tchemisova On a constructive approach to optimality conditions for convex SIP problems with polyhedral index sets [...]
Eaton On the subdifferential regularity of functions of roots of polynomials [...]
H 2051Variational analysis and economic equilibrium [...]
Jourani A characterization of the free disposal condition for nonconvex economies on infinite-dimensional commodity spaces [...]
Bonnisseau On the rank of payoff matrices with long-term assets [...]
Jofré The robust stability of every equilibrium in economic models of exchange even under relaxed standard conditions [...]

 

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
  Today, Payday Loans Ohio are legitimate, but there are illegal transactions that are still on the rise. This is a permit to the world of pleasure and the lasting sex. Cialis Super Active online is a drug, the quality level of which is determined by its action speed.