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


Approximation & online algorithms
H 3010Approximation of vehicle routing problems [...]
van Brink Express delivery of packages [...]
Vargas An efficient decision making process for vehicle operations in underground mining based on a mixed-integer programming model [...]
Bartolini The single-vehicle dial-a-ride problem [...]
Combinatorial optimization
H 3004Approximation algorithms for hard problems [...]
Chen Approximation algorithms for scheduling parallel machines with capacity constraints [...]
Chen Approximation algorithms for parallel open shop scheduling [...]
Hu New models for network connection problems with interval data [...]
H 3005Combinatorial optimization in logistics [...]
Schulz Explanation algorithms in cumulative scheduling [...]
Nossack Benders decomposition for a 1-full-truckload pickup-and-delivery vehicle routing problem [...]
Pesch A branch-and-bound algorithm for the acyclic partitioning problem [...]
H 3008Algorithms in claw-free graphs [...]
Faenza Separating stable sets in claw-free graphs through extended formulations [...]
Nobili A decomposition algorithm for the weighted stable-set problem in claw-free graphs [...]
van Leeuwen Domination when the stars are out - Efficient decomposition of claw-free graphs [...]
H 3012Cliques, stable sets, and perfect graphs [...]
Montenegro On the N-index of the stable set polytope related to antiwebs [...]
Snels Minimum weighted clique cover on strip-composed perfect graphs [...]
H 3013Extended formulations [...]
Serafini Compact formulations for large-scale LP problems [...]
Hildenbrandt An extended formulation for the target visitation problem [...]
Borndörfer Configuration models for solving integrated combinatorial optimization problems [...]
Complementarity & variational inequalities
MA 313Algorithms for complementarity and related problems II [...]
Passacantando Gap functions and penalization for solving equilibrium problems with nonlinear constraints [...]
Lesaja Infeasible full-Newton step interior-point method for linear complementarity problems [...]
Conic programming
H 2036Algebraic geometry and conic programming I [...]
Netzer Describing the feasible sets of semidefinite programming [...]
Burgdorf Lasserre relaxation for trace-optimization of NC polynomials [...]
Sanyal Deciding polyhedrality of spectrahedra [...]
H 2038Recent developments of theory and applications in conic optimization II [...]
Tanaka Numerical computation of a facial reduction algorithm and an inexact primal-dual path-following method for doubly nonnegative optimization problems [...]
Yasuaki A primal barrier function phase I algorithm for nonsymmetric conic optimization problems [...]
Magron Certification of inequalities involving transcendental functions using semi-definite programming. [...]
Derivative-free & simulation-based optimization
H 3003AMINLP and constrained optimization without derivatives [...]
Sobral Constrained derivative-free optimization on thin domains [...]
Müller A surrogate model algorithm for computationally expensive mixed-integer black-box global optimization problems [...]
Griffin A parallel hybrid derivative-free SAS procedure for MINLP [...]
Finance & economics
H 3021Portfolio selection problems [...]
Radulescu Portfolio selection models with complementarity constraints [...]
Radulescu The efficient frontiers of mean-variance portfolio selection problems [...]
H 3027Optimal control [...]
Mukhopadhyay A socio-economic production quantity (SEPQ) model for imperfect items with pollution control and varying setup costs [...]
Takano Control policy optimization for dynamic asset allocation by using kernel principal component analysis [...]
Game theory
MA 005New models and solution concepts II [...]
Hu Existence, uniqueness, and computation of robust Nash equilibrium in a class of multi-leader-follower games [...]
Schwarze Equilibria in generalized Nash games with applications to games on polyhedra [...]
Chen Computing perfect equilibria of finite n-person games in normal form with an interior-point path-following method [...]
MA 043Algorithmic game theory [...]
Lucier Strategyproof mechanisms for competitive influence in social networks [...]
Immorlica Social networks and segregation [...]
Mobius Treasure hunt [...]
Global optimization
H 0110Recent advances in nonconvex quadratic programming with random data [...]
Gillis Fast and robust recursive algorithm for separable nonnegative matrix factorization [...]
Peng Quadratic optimization with separable objective and a single quadratic and box constraint [...]
Krokhmal Asymptotic properties of random multidimensional assignment problems [...]
Implementations & software
H 1058Open source software for modeling and optimization [...]
Gassmann Optimization services: Connecting algebraic modelling languages to several solvers using a web-aware framework [...]
Forrest A bit of CLP (accelerated?) [...]
Integer & mixed-integer programming
H 2013Integer programming in data mining [...]
Liu Optimization issues on some margin-based classifiers [...]
Brooks Counting misclassifications: Robust support vector machines via integer programming [...]
Nogales Gómez Matheuristics for Ψ-learning [...]
H 2032Matheuristics [...]
Valério de Carvalho SearchCol algorithms for the level bin packing problem [...]
Schittekat A matheuristic for competence building with the use of nurse re-rostering [...]
Boschetti A Lagrangian heuristic for the sprint planning in agile methods [...]
H 2033Integer programming approaches to job scheduling [...]
Cacchiani Fixed job scheduling with resource constraints [...]
Clement A big-bucket time-indexed formulation for nonpreemptive single machine scheduling problems [...]
Waterer Maintenance scheduling in critical infrastructure networks [...]
Life sciences & healthcare
MA 376Model discrimination and experimental design [...]
Nattermann A quadratic approximation of confidence regions [...]
Binder Numerical optimization methods for significance analysis of parameters and subsets of metabolic networks [...]
Herzog Discrimination of competetive model candidates for reversals in bacterium Myxococcus xanthus [...]
Logistics, traffic, and transportation
H 0106Optimizing robot welding cells [...]
Pannek Collision avoidance via distributed feedback design [...]
Schwarz The laser sharing problem with fixed tours [...]
Welz Conflict-free job assignment and tour planing of welding robots [...]
MA 042Disruption management [...]
Maher Integrated airline recovery problem on a minimal disruption neighbourhood [...]
Kobayashi Alternative objective functions in ship scheduling for managing supply chain disruption risk [...]
Ionescu Stochastic optimization models for airline resource schedules under disruptions [...]
Mixed-integer nonlinear programming
MA 041Applications of MINLP I [...]
Stangl Feasibility testing for transportation orders in real-life gas networks [...]
Margot The traveling salesman problem with neighborhoods: MINLP solution [...]
Schelbert How to route a pipe - Discrete approaches for physically correct routing [...]
Multi-objective optimization
H 1029Bilevel optimization and risk management [...]
Jahn GPU implementation of a multiobjective search algorithm [...]
Fliege Reformulations of multiobjective bilevel problems [...]
Heyde Set-valued average value at risk [...]
Nonlinear programming
H 0107Optimality conditions and constraint qualifications [...]
Maciel A trust region algorithm for the nonconvex unconstrained vector optimization problem [...]
Silva Constant positive generators: A new weak constraint qualification with algorithmic applications [...]
Srivastav Fritz John duality in the presence of equality and inequality constraints [...]
H 0112Complexity issues in optimization [...]
König Norm maximization is W[1]-hard [...]
Santiago An efficient algorithm for the projection of a point on the intersection of two hyperplanes and a box in Rn [...]
Shi A computational geometric approach for solving linear programming: Toward strong polynomial [...]
Nonsmooth optimization
H 1012Topics in nonsmooth nonconvex optimization [...]
Freire Interior epigraph directions method for nonsmooth and nonconvex optimization via generalized augmented Lagrangian duality [...]
Ahmad Optimality conditions in nondifferentiable multiobjective fractional programming [...]
Goffin Solving unconstrained nonconvex programs with ACCPM [...]
Optimization in energy systems
MA 549Power flow modelling and mechanism design [...]
Lemkens Structural properties of power grid design [...]
Bukhsh Local solutions of optimal power flow problem [...]
Bagchi Optimal combinatorial auction for smart grids with renewable energy resources [...]
MA 550Optimal control [...]
Alais On managing the hydroelectric production of a dam by means of the viability theory [...]
PDE-constrained optimization & multi-level/multi-grid methods
H 0111Optimal control of PDEs with advection terms [...]
Younes The Navier-Stokes problem in velocity-pressure formulation: Convergence and optimal control [...]
Pfaff Optimal boundary control for nonlinear hyperbolic conservation laws with source terms [...]
Al Lawati A rational characteristic method for advection diffusion equations [...]
MA 415Reduced order model based optimization [...]
Schmidt POD reduced-order modeling in the context of direct-approach optimization [...]
Ghiglieri Optimal flow control based on POD and MPC for the cancellation of Tollmien-Schlichting waves by plasma actuators [...]
Koller Optimal control of hydroforming processes based on POD [...]
Robust optimization
MA 004A robust optimization approach to stochastic analysis [...]
Bandi Optimal design for multi-item auctions: A robust optimization approach [...]
Youssef Robust queueing theory [...]
Bertsimas Network information theory via robust optimization [...]
Sparse optimization & compressed sensing
H 1028Greedy algorithms for sparse optimization [...]
Ravikumar Nearest neighbor based greedy coordinate descent [...]
Jain Orthogonal matching pursuit with replacement [...]
Stochastic optimization
MA 141Progressive hedging: Innovations and applications [...]
Woodruff Bundling scenarios in progressive hedging [...]
Kang Parallel solution of structured nonlinear problems using Pyomo and PySP [...]
Watson Asynchronous progressive hedging [...]
MA 144Stochastic network design and reliability [...]
Kantor Layered screening at public events: Models and challenges [...]
Klaus Increasing network reliability by introducing warehouses [...]
Çelik The post-disaster debris clearance problem with uncertain debris amounts [...]
Telecommunications & networks
H 3002Optimization modeling of communication networks [...]
Pioro On a survivable network design problem with one or two failing links and elementary path-flows [...]
Carello A network loading problem with shared protection and SRG: Formulations and ILP based hybrid heuristics [...]
Steglich Robust multi-layer network design under traffic demand uncertainty [...]
H 3503Robust and survivable network design [...]
Raack Cutset inequalities for robust network design [...]
Pecorari Models for p-cycle networks design without cycle enumeration [...]
Yuan Cell load coupling in planning and optimization of LTE networks [...]
Variational analysis
H 2035Variational-analytic foundations of sensitivity analysis [...]
Zhang Partial smoothness, tilt stability, and generalized Hessians [...]
Husain On second-order Fritz John type duality for variational problems [...]
Drusvyatskiy Identifiability and the foundations of sensitivity analysis [...]
H 2051Generalized differentiation and applications [...]
Pallaschke Quasidifferentiable calculus and minimal pairs of compact convex sets [...]
Bagirov Subgradient methods in nonconvex nonsmooth optimization [...]
Goncharov Well-posedness of minimal time problem with constant convex dynamics via differential properties of the value function [...]


Friday, 13:15 - 14:45 h


Approximation & online algorithms
H 3010Scheduling and online algorithms [...]
Grigoriu Scheduling on uniform processors with at most one downtime on each machine [...]
Flatberg Online bin covering with lookahead and bounded space [...]
Potts On-line production planning to maximize on-time orders [...]
Combinatorial optimization
H 3004Packing, covering and domination I [...]
Wagler Generalized row family inequalities for the set covering polyhedron [...]
Argiroffo The identifying code polyhedron of cycles [...]
Valicov Complexity of identifying codes in some subclasses of perfect graphs [...]
H 3005Nonlinear combinatorial optimisation problems I [...]
Baumann Exact algorithms for combinatorial optimization problems with submodular objective functions [...]
Liers A polyhedral approach to the quadratic matching problem [...]
Narayanan Some properties of integer hulls of convex sets [...]
H 3013Facility location [...]
Rybicki Improved LP-rounding approximation algorithm for k-level uncapacitated facility location [...]
Ahmadian Improved approximation guarantees for lower-bounded facility location [...]
Complementarity & variational inequalities
MA 313Variational inequality problems: Analysis and computation [...]
Shanbhag On the analysis and solution of stochastic variational inequalities [...]
Su Estimation of pure characteristics demand models with pricing [...]
Xu Quantitative stability analysis of stochastic generalized equations and applications [...]
Conic programming
H 2036Algebraic geometry and conic programming, part II [...]
Nie Certifying convergence of Lasserre's hierarchy via flat truncation [...]
Ninin Abstract cones of positive polynomials and sums of squares [...]
Uschmajew Convergence of algorithms on quotient manifolds of Lie groups [...]
H 2038Warmstarting interior point methods [...]
Skajaa Warmstarting the homogeneous and self-dual interior point method for linear and conic quadratic problems [...]
Yildirim Warm-start strategies: What matters more? [...]
González-Brevis A new warm-starting strategy for the primal-dual column generation method [...]
Derivative-free & simulation-based optimization
H 3003AMultiple objectives in derivative-free optimization [...]
Rinaldi Using an exact penalty function for multiobjective Lipschitz programs [...]
Vicente Efficient cardinality/mean-variance portfolios [...]
Custodio Direct MultiSearch: A robust and efficient approach to multiobjective derivative-free optimization [...]
Finance & economics
H 3021Risk management under probability model misspecification [...]
Wozabal Robustifying convex risk measures: A non-parametric approach [...]
Demiguel Stock return serial dependence and out-of-sample portfolio performance [...]
H 3027Generalized nash equilibrium problems [...]
Renner Computing generalized Nash equilibria by polynomial programming [...]
Spieksma Testing rationality: algorithms and complexity [...]
Couzoudis Finding all generalized Nash equilibria [...]
Game theory
MA 005Competition on networks [...]
Nikolova A mean-risk model for the stochastic traffic assignment problem [...]
Stier-Moses The competitive facility location problem in a duopoly: Advances beyond trees [...]
Ordonez Stackelberg security games on networks [...]
MA 043Equilibria in congestion games [...]
von Falkenhausen Optimal cost sharing protocols for matroid congestion games [...]
Pradeau Uniqueness of equilibrium on rings [...]
Klimm Existence and computation of equilibria in bottleneck congestion games [...]
Global optimization
H 0110Algorithms and applications [...]
Prudente An augmented Lagrangian method with finite termination [...]
Bueno Low order-value approach for solving VaR-constrained optimization problems [...]
Andretta Deterministic and stochastic global optimization techniques for planar covering with elipses problems [...]
H 2053Advances in global optimization V [...]
Bigi Beyond canonical DC programs: The single reverse polar problem [...]
Konzett Numerical enclosures of solution manifolds at near singular points [...]
Gabidullina Universal measure of the thickness of separator or pseudo-separator for sets of Euclidean space [...]
Implementations & software
H 1058Conic linear programming [...]
Helmberg Speeding up the spectral bundle method by solving the quadratic semidefinite subproblems with a PSQMR approach [...]
Jarre Solving large scale problems over the doubly nonnegative cone [...]
Toh An inexact accelerated proximal gradient method for large scale convex quadratic SDP [...]
Integer & mixed-integer programming
H 2013Trends in integer programming [...]
Basu A (k+1)-slope theorem for the k-dimensional infinite group relaxation [...]
Shen Bilevel interdiction and risk-and-return tradeoffs in probabilistic programs with single or multiple chance constraints [...]
Ryan Computing pure Nash equilibria in symmetric games [...]
H 2032Integer points in polytopes I [...]
De Loera Top Ehrhart coefficients of knapsack problems [...]
Gubeladze Continuous evolution of lattice polytopes [...]
Averkov Lattice-free integer polyhedra and their application in cutting-plane theory [...]
H 2033Cutting plane theory [...]
Del Pia On the rank of disjunctive cuts [...]
Buyuktahtakin Partial objective function inequalities for the multi-item capacitated lot-sizing problem [...]
Hildebrand The triangle closure is a polyhedron [...]
Life sciences & healthcare
MA 376Cell biology [...]
Gao Towards automatic NMR protein structure determination [...]
Mestre Tree-constrained matching [...]
Andreotti De novo peptide sequencing with mathematical programming [...]
Logistics, traffic, and transportation
H 0106Revenue management applications [...]
Jagabathula Assortment optimization under general choice [...]
den Boer Simultaneously learning and optimizing in dynamic pricing and revenue management [...]
Davis Assortment optimization under variants of the nested logit model [...]
MA 042Optimization in logistics [...]
Frey Column generation for planning the outbound baggage handling at airports [...]
Funke A mixed integer program for a variant of the truck and trailer routing problem with time windows [...]
Fügenschuh Scheduling and routing of fly-in safari airplanes [...]
Mixed-integer nonlinear programming
MA 041Applications of MINLP II [...]
Huang Primal heuristics for nonconvex MINLPs modelling optimal operation of water distribution networks [...]
Held Challenges and requirements for MINLPs in industrial applications [...]
Multi-objective optimization
H 1029Portfolio selection [...]
Abad Portfolio selection with multiple spectral risk constraints [...]
Yaghoobi Using ball center of a polytope to solve a multiobjective linear programming problem [...]
Nonlinear programming
H 0107Stability and solution methods [...]
Klatte Metric regularity versus strong regularity for critical points of nonlinear programs [...]
Bütikofer Influence of inexact solutions in a lower level problem on the convergence behavior of a nonsmooth newton method [...]
Kummer Newton schemes for functions and multifunctions [...]
H 0112Optimality conditions I [...]
Ahmetoğlu Necessary conditions for a convex programming problem in Banach spaces partially ordered by a cone with empty interior [...]
MA 004Fast gradient methods for nonlinear optimization and applications I [...]
Hongchao An adaptive preconditioned nonlinear conjugate gradient method with limited memory [...]
Diao A sequential quadratic programming method without a penalty function or a filter for general nonlinear constrained optimization [...]
Toraldo On the use of spectral properties of the steepest descent method [...]
Nonsmooth optimization
H 1012Nonsmooth optimization and applications [...]
Noll Non-convex bundle algorithm with inexact sub-gradient and function values [...]
Fischer An asynchronous parallel bundle method for Lagrangian relaxation [...]
Optimization in energy systems
MA 550Stochastic equilibria in energy markets I [...]
Zakeri Models for large consumer peak shaving and the impact on line pricing [...]
de Maere Modelling market liquidity in restructured power systems by stochastic Nash and generalized Nash equilibrium [...]
Ehrenmann Risk adjusted discounting [...]
MA 550Generation and expansion problems [...]
Lindahl Discrete optimization support system for the collection grid in large offshore wind parks [...]
Zigrino A multistage stochastic model for the electric power generation capacity expansion problem of a price-taker power producer in a multi-year horizon [...]
Cada Optimizing nuclear fuel reload patterns [...]
PDE-constrained optimization & multi-level/multi-grid methods
H 0111PDE-constrained optimization problems with non-smooth structures [...]
Luong A multiresolution algorithm for large scale non-smooth convex optimization problems [...]
Vallejos Multigrid methods for elliptic optimal control problems with pointwise mixed control-state constraints [...]
Löbhard Optimal control of elliptic variational inequalities: A mesh-adaptive finite element solver [...]
MA 415Hierarchical methods for the design of nanoporous materials [...]
Boggs Combining multi-grid and domain decomposition as preconditioners for a class of multi-level PDE-constrained optimization problems [...]
Gay Optimization algorithms for hierarchical problems, with application to nanoporous materials [...]
Lewis Using inexact gradients in a multilevel optimization algorithm [...]
Sparse optimization & compressed sensing
H 1028Structured matrix optimization [...]
van den Berg Phase-retrieval using explicit low-rank matrix factorization [...]
Harchaoui Lifted coordinate descent for learning with Gauge regularization [...]
Dhillon Sparse inverse covariance matrix estimation using quadratic approximation [...]
Stochastic optimization
MA 141Target oriented optimization under uncertainity [...]
Long Managing operational and financing decisions to meet consumption targets [...]
Qi Routing optimization with deadlines under uncertainty [...]
MA 144Stochastic algorithms [...]
Luo A nonadaptive probabilistic group testing algorithm for detecting consecutive positives of linear DNA library [...]
Hansen Information-geometric optimization [...]
Theile How crossover helps in pseudo-boolean optimization [...]
Telecommunications & networks
H 3002Game theoretic concepts in telecommunications [...]
Medel Optimal regulation with non discriminatory prices in mobile two way access, with call externalities and heterogeneous costumers [...]
Krolikowski Game theoretic model for the downlink in cellular mobile networks: Nash equilibria and algorithmic convergence [...]
H 3503Markovian and randomized techniques for network optimization [...]
Fercoq Polyhedral and ergodic control approaches to PageRank optimization and spam detection [...]
Gómez Development of a hybrid algorithm based on the application of metaheuristics on an Internet Protocol Television platform using Tabu Search (TS) and Genetic Algorithm (GA) [...]
Guzman Network congestion control with Markovian multipath routing [...]
Variational analysis
H 2035Optimization in infinite dimensional spaces [...]
Blot Discrete-time Pontryagin principles and ordered Banach spaces [...]
Donchev Runge-Kutta methods for differential equations with variable time of impulses [...]
Resmerita A discrepancy principle for the augmented Lagrangian method [...]
H 2051Duality in convex optimization [...]
Csetnek Conjugate duality and the control of linear discrete systems [...]
Heinrich The support vector machines approach via Fenchel-type duality [...]
Grad Classical linear vector optimization duality revisited [...]


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
  There are three major facts that should be watched out for in all payday loans in the United States. If you have already decided to take Levitra, be sure to consult a doctor, you don't have any contraindications and act strictly due to a prescription.