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

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 [...]


Wednesday, 13:15 - 14:45 h


Approximation & online algorithms
H 3010Approximation in routing and scheduling [...]
Soto The traveling salesman problem in cubic graphs [...]
Verschae The power of recourse for online MST and TSP [...]
Telha The jump number (maximum independent set) of two-directional orthogonal-ray graphs [...]
Combinatorial optimization
H 3004Extended formulations in discrete optimization III [...]
Tiwary Extended formulations for polygon [...]
Conforti Extended formulations in mixed-integer programming [...]
Zambelli Mixed-integer bipartite vertex covers and mixing sets [...]
H 3005Geometric combinatorial optimization [...]
Queyranne Modeling convex subsets of points [...]
Dragoti-Cela On the x-and-y axes travelling salesman problem [...]
H 3008Combinatorics and geometry of linear optimization IV [...]
Gärtner Abstract optimization problems revisited [...]
Di Summa A new bound on the diameter of polyhedra [...]
Kim Subset partition graphs and an approach to the linear Hirsch conjecture [...]
H 3012Heuristics II [...]
Bouamama A population-based iterated greedy algorithm for the minimum weight vertex cover problem [...]
Djadoun Random synchronized prospecting: A new metaheuristic for combinatorial optimization [...]
H 3013Assignment problems [...]
Dahl Generalized Birkhoff polytopes and majorization [...]
Heismann The hypergraph assignment problem [...]
H 3021Graph partitioning and clustering [...]
Werneck Exact combinatorial branch-and-bound for graph bisection [...]
Christian High quality graph partitioning [...]
Meyerhenke Current trends in graph clustering [...]
Complementarity & variational inequalities
MA 313Advances in the theory of complementarity and related problems II [...]
Lignola Mathematical programs with quasi-variational inequality constraints [...]
Gwinner On linear differential variational inequalities [...]
Conic programming
H 2036Semidefinite programming and geometric representations of graphs [...]
Reiss Optimizing extremal eigenvalues of the weighted Laplacian of a graph [...]
de Carli Silva Optimization problems over unit-distance representations of graphs [...]
Varvitsiotis Two new graph parameters related to semidefinite programming with a rank constraint [...]
H 2038Conic and convex programming in statistics and signal processing III [...]
Needell Randomized projection algorithms for overdetermined linear systems [...]
Wright Packing ellipsoids (and chromosomes) [...]
Saunderson Polynomial-sized semidefinite representations of derivative relaxations of spectrahedral cones [...]
Constraint programming
H 3003AConstraint solvers and implementations [...]
Schulte Gecode: An open constraint solving library [...]
De Backer Constraint programming and optimization at Google [...]
Prud'homme A DSL for programming propagation engine [...]
Derivative-free & simulation-based optimization
H 3503Derivative-free applications and parallelization [...]
Martinez Design of river fishways: A derivative-free optimization perspective [...]
Vaz Vibration-based structural health monitoring based on a derivative-free global optimization approach [...]
Olsson Parallelization of algorithms for derivate-free optimization [...]
Finance & economics
H 3027Optimization methodologies in computational finance [...]
Fulga Portfolio optimization with a new quantile-based risk measure and prior AHP stock ranking [...]
Xu A new sampling strategy willow tree method with application to path-dependent option pricing [...]
Shupo Optimal promotion rate in a cash campaign [...]
Game theory
MA 005Polynomial-time algorithms for mechanism design [...]
Krysta Combinatorial auctions with verification [...]
Csapo The private provision of a public good: Digging for gold [...]
Vidali Scheduling, auctions and truthfulness [...]
MA 043Analysis of auction mechanisms [...]
Paes Leme Polyhedral clinching auctions and the AdWords polytope [...]
Caragiannis Welfare and revenue guarantees in sponsored search auctions [...]
Syrgkanis Efficiency in sequential auctions [...]
Global optimization
H 2053Global optimization methods and applications [...]
Pardalos Global optimality conditions in non-convex optimization [...]
Moreno-Centeno Solving combinatorial optimization problems as implicit hitting set problems [...]
Buchanan Maximum clique problem on very large scale sparse networks [...]
Implementations & software
H 0110Exact MIP/LP solvers [...]
Hoffmann Integration of an LP solver into interval constraint propagation [...]
Wolter An exact rational mixed-integer programming solver [...]
Parekh Computing certificates for integer programs [...]
H 1058Software for PDE-constrained optimization [...]
Young Software abstractions for matrix-free PDE optimization with cone constraints [...]
Potschka MUSCOP: A multiple shooting code for time-periodic parabolic PDE constrained optimization [...]
Kourounis Gradient-based optimization using adjoint methods for optimization of compositional flow in porous media [...]
Integer & mixed-integer programming
H 2013Scheduling II [...]
Thörnblad A time-indexed formulation of a flexible job shop problem including preventive maintenance and availability of fixtures [...]
Wojciechowski Opportunistic replacement scheduling with interval costs [...]
Gokce Scheduling for disassembly systems [...]
H 2032Polyhedral theory [...]
Michini How tight is the corner relaxation? Insights gained from the stable set problem [...]
Poirrier The strength of multi-row models [...]
Doostmohammadi Valid inequalities for the single arc design problem with set-ups [...]
H 2033Lattices and integer programming [...]
von Heymann The structure of LLL-reduced kernel lattice bases: Theoretical details [...]
Aardal The structure of LLL-reduced kernel lattice bases: background and outline of the main result [...]
Lodi On cutting planes and lattice reformulations [...]
Life sciences & healthcare
MA 376(Next generation) sequences [...]
Canzar Transcriptome reconstruction using delayed column generation [...]
Marschall CLEVER: Clique-enumerating variant finder [...]
Pape Computational complexity of the multiple sequence alignment problem [...]
Logistics, traffic, and transportation
H 0104TomTom routing and traffic research: data, models and algorithms [...]
Schilling TomTom Navigation - How mathematics help getting through traffic faster [...]
Kesting The dynamics of traffic jams - How data and models help to understand the principles behind [...]
Koenig Crowd-sourcing in navigation - How selfish drivers help to reduce congestion for all [...]
H 0106Math programming in supply chain applications [...]
Rusmevichientong Robust assortment optimization [...]
Cohen Designing consumer subsidies with industry response for green technology adoption [...]
Harsha Demand-response in the electricity smart grid: A data-driven pricing and inventory optimization approach [...]
H 0111New algorithms for new pricing models [...]
Briceño-Arias Optimal continuous pricing with strategic consumers [...]
Goel Reputation and trust in social networks [...]
Malekian Bayesian optimal auctions via multi- to single-agent reduction [...]
Mixed-integer nonlinear programming
MA 041Structured MINLP and applications [...]
Lastusilta Chromatographic separation using GAMS extrinsic functions [...]
Goldberg Cover inequalities for nearly monotone quadratic MINLPs [...]
Margulies Hilbert's Nullstellensatz and the partition problem: An infeasibility algorithm via the partition matrix and the partition polynomial [...]
MA 042Topics in mixed-integer nonlinear programming II [...]
Calinescu Optimal resource allocation in survey designs [...]
Engelhart A new test-scenario for analysis and training of human decision making with a tailored decomposition approach [...]
Multi-objective optimization
H 1029Nonlinear multiobjective optimization [...]
Steponavice On robustness for simulation-based multiobjective optimization [...]
Lucambio Perez A modified subgradient algorithm for solving K-convex inequalities [...]
Nonlinear programming
H 0107Regularization techniques in optimization II [...]
Bellavia Regularized Euclidean residual algorithm for nonlinear least-squares with strong local convergence properties [...]
Morini Preconditioning of sequences of linear systems in regularization techniques for optimization [...]
Gratton Preconditioning inverse problems using duality [...]
H 0112Applications of optimization I [...]
Yamashita An approach based on shortest path and connectivity consistency for sensor network localization problems [...]
Patriksson Nonlinear continuous resource allocation - A numerical study [...]
Steinbach Estimating material parameters by X-ray diffraction [...]
Nonsmooth optimization
H 1012Applications of nonsmooth optimization [...]
Strömberg Lagrangian optimization for inconsistent linear programs [...]
Xavier The continuous multiple allocation p-hub median problem solving by the hyperbolic smoothing approach: Computational performance [...]
Sadoghi Piecewise monotonic regression algorithm for problems comprising seasonal and monotonic trends [...]
Optimization in energy systems
MA 549Robust aspects of optimization in energy management [...]
van Ackooij Decomposition methods for unit-commitment with coupling joint chance constraints [...]
Möller Probabilistic programming in power production planning [...]
Kovacevic A process distance approach for scenario tree generation with applications to energy models [...]
MA 550Stochastic optimization applied to power systems [...]
Lumbreras Efficient incorporation of contingency scenarios to stochastic optimization. Application to power systems. [...]
Cerisola Approximations of recourse functions in hydrothermal models. Numerical experiencies. [...]
Munoz Using decomposition methods for wide-area transmission planning to accommodate renewables: A multi-stage stochastic approach [...]
PDE-constrained optimization & multi-level/multi-grid methods
MA 415Optimization applications in industry IV [...]
Pesch Direct versus indirect solution methods in real-life applications: Load changes of fuel cells [...]
Landry Modeling of the optimal trajectory of industrial robots in the presence of obstacles [...]
Désidéri Multiple gradient descent algorithm (MGDA) for multi-objective optimization with application to compressible aerodynamics [...]
Robust optimization
MA 004Applications of robust optimization IV [...]
Vera Improving consistency of tactical and operational planning using robust optimization [...]
Bruns Robust load planning of trains in intermodal transportation [...]
Poirion Robust optimal sizing of an hybrid energy stand-alone system [...]
Sparse optimization & compressed sensing
H 1028Efficient first-order methods for sparse optimization and its applications [...]
Ma An alternating direction method for latent variable Gaussian graphical model selection [...]
Lu Sparse approximation via penalty decomposition methods [...]
Goldfarb An accelerated linearized Bregman method [...]
Stochastic optimization
MA 141Scenario generation in stochastic optimization [...]
Papp Generating moment matching scenarios using optimization techniques [...]
Pennanen Tractability of stochastic programs [...]
Desai A mathematical programming framework for decision tree analysis [...]
MA 144Large-scale stochastic programming [...]
Grothey Multiple-tree interior point method for stochastic programming [...]
Lubin Parallel and distributed solution methods for two-stage stochastic (MI)LPs [...]
Römisch Are quasi-Monte Carlo methods efficient for two-stage stochastic programs? [...]
Telecommunications & networks
H 3002Length bounded trees [...]
Ljubic Layered graph models for hop constrained trees with multiple roots [...]
Leitner New models for the diameter constrained steiner tree problem [...]
Bley Capacitated facility location with length bounded trees [...]
Variational analysis
H 2035Structural properties in variational analysis [...]
Mordukhovich Second-Order variational analysis and stability in optimization [...]
Lewis Active sets and nonsmooth geometry [...]
Lu Confidence regions and confidence intervals for stochastic variational inequalities [...]
H 2051Equilibrium problems: Formulations and methodologies [...]
Daniele General financial models: Methodologies and suggestions for the recovery [...]
Crespi Minty variational principle in set optimization [...]
Wakolbinger A variational inequality formulation of economic network equilibrium models with nonlinear constraints [...]


Wednesday, 15:15 - 16:45 h


Approximation & online algorithms
H 3010Randomized rounding algorithms in mathematical programming [...]
Nagarajan Thresholded covering algorithms for robust and max-min optimization [...]
Srinivasan Dependent rounding and its applications [...]
Im Preemptive and non-preemptive generalized min sum set cover [...]
Combinatorial optimization
H 3004Knapsack and bin packing [...]
Newman A counterexample to Beck's three permutations conjecture [...]
Detti The bounded sequential multiple knapsack problem [...]
Schauer Knapsack problems with disjunctive constraints [...]
H 3005Graph coloring [...]
Sukegawa Lagrangian relaxation and pegging test for clique partitioning problems [...]
Jurkiewicz Colorings of the strong product of graphs [...]
Marecek Semidefinite programming relaxations in timetabling and matrix-free implementations of augmented Lagrangian methods for solving them [...]
H 3008Competitive and multi-objective facility location [...]
Beresnev Algorithms for discrete competitive facility location problem [...]
Kochetov A local search algorithm for the (r | p)-centroid problem on the plane [...]
Pascoal Path based method for multicriteria metro location [...]
H 3012Heuristics III [...]
Kononova Local search heuristic for the buffer-constrained two-stage multimedia scheduling problem [...]
Cayir A genetic algorithm for truck to door assignment in warehouses [...]
H 3013Polyhedra in combinatorial optimization [...]
Koichi A note on ternary semimodular polyhedra [...]
Maksimenko The common face of some 0/1 polytopes with NP-complete nonadjacency relations [...]
Li The polyhedral relationship between the capacitated facility location polytope and its knapsack and single-node flow relaxations [...]
H 3021Routing in road networks [...]
Goldberg The hub labeling algorithm [...]
Delling Realistic route planning in road networks [...]
Sanders Advance route planning using contraction hierarchies [...]
Complementarity & variational inequalities
MA 313Applications of complementarity [...]
Pang On differential linear-quadratic Nash games with mixed state-control constraints [...]
Shmyrev A polyhedral complementarity algorithm for searching an equilibrium in the linear production-exchange model. [...]
Chen A power penalty method for fractional Black-Scholes equations governing American option pricing [...]
Conic programming
H 2036First-derivative methods in convex optimization [...]
Drori Performance of first-order methods for smooth convex minimization: A novel approach [...]
Gonzaga On the complexity of steepest descent algorithms for minimizing quadratic functions [...]
Karimi CGSO for convex problems with polyhedral constraints [...]
H 2038Conic and convex programming in statistics and signal processing IV [...]
Sun Finding the nearest correlation matrix of exact low rank via convex optimization [...]
Negahban Fast global convergence of composite gradient methods for high-dimensional statistical recovery [...]
Fazel Algorithms for Hankel matrix rank minimization for system identification and realization [...]
Constraint programming
H 3003AComputational sustainability [...]
Holland Optimising the economic efficiency of monetary incentives for renewable energy investment [...]
Schönfelder Stochastic routing for electric vehicles [...]
Gavanelli Simulation and optimization for sustainable policy-making [...]
Derivative-free & simulation-based optimization
H 3503Stochastic zero-order methods [...]
Faco A continuous GRASP for global optimization with general linear constraints [...]
Stich Convergence of local search [...]
Auger Convergence of adaptive evolution strategies on monotonic C2-composite and scale-invariant functions [...]
Finance & economics
H 3027Management of portfolios and liabilities [...]
Martín-Utrera Size matters: Calibrating shrinkage estimators for portfolio optimization [...]
Trichakis Fairness in multi-portfolio optimization [...]
Júdice Long-term bank balance sheet management: Estimation and simulation of risk-factors [...]
Game theory
MA 005Network sharing and congestion [...]
Blogowski Access network sharing between two telecommunication operators [...]
Wan Coalitions in nonatomic network congestion games [...]
Zeitoun The complexity of approximate Nash equilibrium in congestion games with negative delays [...]
MA 043Solving cooperative games [...]
Nguyen Finding solutions of large cooperative games [...]
Zhao A mixed-integer programming approach to the determination of a core element for an n-person cooperative game with nontransferable utility [...]
Ando Computation of the Shapley value of minimum cost spanning tree games: #P-hardness and polynomial cases [...]
Global optimization
H 2053Nonconvex optimization: Theory and algorithms [...]
Dalkiran RLT-POS: Reformulation-linearization technique-based optimization software for polynomial programming problems [...]
Ryoo 0-1 multilinear programming & LAD patterns [...]
Schaber Convergence order of relaxations for global optimization of nonlinear dynamic systems [...]
Implementations & software
H 0110Commercial mathematical programming solvers I [...]
Koch Any progress one year after MIPLIB 2010 ? [...]
Perregaard Recent advances in the Xpress MIP solver [...]
Achterberg Cover probing for mixed integer programs [...]
H 1058Software for large-scale optimization [...]
Richter FiOrdOs: A Matlab toolbox for C-code generation for first-order methods [...]
Phipps Support embedded algorithms through template-based generic programming [...]
Integer & mixed-integer programming
H 2013Scheduling III [...]
Hein Mathematical model of hierarchical production planning [...]
Recalde Scheduling the Ecuadorian professional football league by integer programming [...]
Stephan Smaller compact formulation for lot-sizing with constant batches [...]
H 2032Branch-and-price I: Generic solvers [...]
Lübbecke A generic branch-price-and-cut solver [...]
Ralphs Dip and DipPy: Towards a generic decomposition-based MIP solver [...]
Galati The new decomposition solver in SAS/OR [...]
H 2033Some bridges between algebra and integer programming [...]
Blanco Applications of discrete optimization to numerical semigroups [...]
Hartillo Algebraic tools for nonlinear integer programming problems 2: Applications [...]
Ucha Algebraic tools for nonlinear integer programming problems 1: Getting started. [...]
Life sciences & healthcare
MA 376Radiation therapy treatment planning [...]
Long Beam orientation optimization in radiation therapy treatment planning [...]
Fredriksson A characterization of robust radiation therapy optimization methods [...]
Epelman A column generation-based algorithm for Volumetric Modulated Arc Therapy (VMAT) treatment plan optimization [...]
Logistics, traffic, and transportation
H 0106Vehicle and crew planning [...]
Froyland Robust airline schedule planning, aircraft routing and crew pairing: An integrated scenario-based approach [...]
Swarat Modeling and solving a toll enforcement problem [...]
Sahin Tactical and strategic crew planning problems in railways [...]
H 0111Public transportation [...]
Vahid An integer linear programming model for bus rapid transit network design [...]
Tou A dial-a-ride problem for public transport using electric vehicles [...]
Schmidt A new model for capacitated line planning [...]
Mixed-integer nonlinear programming
MA 041Quadratic integer programming [...]
Buchheim Nonconvex underestimators for integer quadratic optimization [...]
Trieu Convex piecewise quadratic integer programming [...]
Jeon Convex quadratic programming with variable bounds [...]
MA 042Topics in mixed-integer nonlinear programming III [...]
Li MIQP solvers for quadratic programs with cardinality and minimum threshold constraints: A semidefinite program approach [...]
Sharma A duality based approach for a class of bilevel programming problems [...]
Multi-objective optimization
H 1029Applications of vector and set optimization [...]
Radjef The direct support method to solve a linear multiobjective problem with bounded variables [...]
Löhne BENSOLVE - A solver for multi-objective linear programs [...]
Ulus An approximation algorithm for convex vector optimization problems and its application in finance [...]
Nonlinear programming
H 0107Line-search strategies [...]
Birgin Spectral projected gradients: Reviewing ten years of applications [...]
Santos An adaptive spectral approximation-based algorithm for nonlinear least-squares problems [...]
Krejic Nonmonotone line search methods with variable sample sizes [...]
H 0112Applications of optimization II [...]
Göllner Geometry optimization of branched sheet metal products [...]
Fedossova Modeling of transboundary pollutant displacement for groups of emission sources [...]
Nonsmooth optimization
H 1012Variational methods in optimization [...]
Ovcharova Second-order analysis of the Moreau-Yosida and the Lasry-Lions regularizations [...]
Optimization in energy systems
MA 549Stochastic programming in energy [...]
Perez Valdes Parallel computational implementation of a branch and fix coordination algorithm [...]
Li Stochastic nonconvex MINLP models and global optimization for natural gas production network design under uncertainty [...]
Hellemo Stochastic programming with decision dependent probabilities [...]
MA 549Congestion management and pricing [...]
Bjørndal Congestion management in the nordic electricity market [...]
Rud Nodal versus zonal pricing: Market power in day-ahead versus in balancing services [...]
Smeers Stochastic equilibrium in investment models: Capacity expansion in the power [...]
PDE-constrained optimization & multi-level/multi-grid methods
MA 415Optimization applications in industry V [...]
Laurain A shape and topology optimization method for inverse problems in tomography [...]
Roesch Optimal control of a chemotaxis problem [...]
Hokenmaier Optimization with discontinuities and approximations in process engineering [...]
Robust optimization
MA 004Applications of robust optimization V [...]
Takeda Robust optimization-based classification method [...]
Sichau Shape optimization under uncertainty employing a second order approximation for the robust counterpart [...]
Sparse optimization & compressed sensing
H 1028Structured models in sparse optimization [...]
Jenatton Proximal methods for hierarchical sparse coding and structured sparsity [...]
Pham Alternating linearization for structured regularization problems [...]
Duchi Adaptive subgradient methods for stochastic optimization and online learning [...]
Stochastic optimization
MA 141Algorithms and applications for stochastic programming [...]
Zhou A network based model for traffic sensor placement with implications on congestion observation [...]
Jiang Optimization under data-driven chance constraints [...]
Bayraksan A sequential bounding method for a class of two-stage stochastic programs [...]
MA 144Network design, reliability, and PDE constraints [...]
Myndyuk Stochastic network design under probabilistic constraint with continuous random variables. [...]
Šabartová Spatial decomposition for differential equation constrained stochastic programs [...]
Tahmasbi Network flow problems with random arc failures [...]
Telecommunications & networks
H 3002Local access networks [...]
Gollowitzer Capacitated network design with facility location [...]
Rezapour Approximation algorithms for connected facility location with buy-at-bulk edge costs [...]
Arulselvan An incremental algorithm for the facility location problem [...]
Variational analysis
H 2035Nonsmooth analysis with applications in engineering [...]
Iusem Th effect of calmness on the solution set of nonlinear equaltions [...]
Uderzo On some calmness conditions for nonsmooth constraint systems [...]
Cibulka Quantitative stability of a generalized equation: Application to non-regular electrical circuits [...]
H 2051Some stability aspects in optimization theory [...]
Hantoute On convex relaxation of optimization problems [...]
Pang First order analysis of set-valued maps and differential inclusions [...]
Shikhman Implicit vs. inverse function theorem in nonsmooth analysis [...]


Sorted by cluster |  Room Mon | Tue | Wed | Thu | Fri
10:30 | 13:15 | 15:15 | any
  Payday Loans In Florida. They were lucky to produce Viagra Sublingual which dissolves under the tongue and penetrates into the blood causing erection faster than any other drugs.