Mathematical Programming
Yüklə 23,3 Mb. Pdf görüntüsü
|
Room Discrete Optimization & Integer Programming - Thursday 5:00 PM – 6:30 PM Salle 43 Advances in Integer Programming, Organizer: Robert Hildebrand, session 227 IPtheory Build C, Z 1 3rd floor 4x20 min Laura Sanit`a, On the diameter of the frac- tional matching polytope Gonzalo Mu˜noz, Treewidth-based Exten- sion Complexity Lower Bounds Igor Malinovic, On valid inequalities for knapsack polytopes Robert Hildebrand, Polynomial Integer Programming in Fixed Dimension and Ap- plications in FPT Salle 42 Cutting Planes for Special Problems, Chair: Eleazar Madriz, session 517 IPtheory Build C, Z 1 3rd floor 3x30 min Ruslan Simanchev, Separation problem for 2-partition inequalities Mark´o Horv´ath, Polyhedral results for po- sition based scheduling of chains on a sin- gle machine Eleazar Madriz, A Benders procedure for the b-complementary multisemigroup dual program. Salle 36 Matching Problems, Organizer: Sergio García Quiles, session 175 IPpractice Build B, Z 4 Intermediate 4x20 min Thanh Nguyen, Stable Matching with Pro- portionality Constraints Maxence Delorme, Mathematical models for stable marriage problems with ties William Pettersson, Improvements in Kidney Exchange Programme Models for Large-Scale Programmes Peter Biro, Stable project allocation under distributional constraints Salle 44 Cutting Planes, Chair: Fabrizio Marinelli, session 485 IPpractice Build C, Z 1 3rd floor 4x20 min Edvin ABlad, A tighter ILP model and an improved branching for a load-balancing problem S´avio Dias, A Branch-and-Cut Approach for the Car Renter Salesman Problem Georgia Souli, On Lifted Cover Inequal- ities: A New Lifting Procedure with Un- usual Properties Fabrizio Marinelli, Exploiting star in- equalities for the maximum quasi-clique problem DURKHEIM Convexification and more (II), Organizer: Akshay Gupte, session 106 MINLP Build A, Z 1 3rd floor 3x30 min Christoph Buchheim, Binary Program- ming with Semilinear Elliptic PDE- constraints Christopher Coey, Using algebraic struc- ture to accelerate polyhedral approxima- tion Andres Gomez, Quadratic optimization with M-matrices and semi-continuous vari- ables Salle 34 Relaxations in MINLP, Chair: Jan Kronqvist, session 280 MINLP Build B, Z 3 1st floor 3x30 min Ralf Lenz, Tight Convex Relaxations for Expansion Planning of Potential Driven Networks Jan Kronqvist, Using Regularization and Second Order Derivatives with Outer Ap- proximation Andreas Lundell, The Supporting Hy- perplane Optimization Toolkit for Convex MINLP Salle 35 Applications in MINLP, Chair: Justo Puerto, session 283 MINLP Build B, Z 4 Intermediate 3x30 min Do Duc Le, Modeling and optimization of tra ffic at traffic-light controlled intersec- tions Maximilian Merkert, Flow-based ex- tended formulations for feasible tra ffic light controls Justo Puerto, MINLP for pricing transac- tion costs in di fferent models of portfolio selection LEYTEIRE Approximation Algorithms for Optimization under Uncertainty, Organizer: Marc Uetz, session 95 APPROX Build E, Z 1 3rd floor 3x30 min Thomas Kesselheim, Prophet Inequalities Made Easy: Stochastic Opt. by Pricing Non-Stochastic Inputs Max Klimm, Hiring Secretaries over Time: The Benefit of Concurrent Employment Marc Uetz, Greed is Good - Online Al- gorithms for Stochastic Unrelated Machine Scheduling Salle 41 Approximation algorithms for combinatorial optimization problems, Organizer: Thomas Rothvoss, session 265 COMB Build C, Z 1 3rd floor 3x30 min Mohit Singh, Approximation Algorithms for Diverse Subset Selection Problems Roy Schwartz, Local Guarantees in Graph Cuts and Clustering Anupam Gupta, Scheduling Stochastic Jobs on Unrelated Machines Salle 39 Heuristics for combinatorial optimization problems, Chair: Evren Guney, session 428 COMB Build E, Z 1 3rd floor 4x20 min Cid de Souza, A Matheuristic to the Fire- fighter Problem on Graphs Shinsaku Sakaue, Accelerated Best-first Search for Monotone Submodular Func- tion Maximization Kazuya Fukuoka, A statistical stopping criterion for simulated annealing Evren Guney, A Lagrangean Relaxation Based Heuristic For E fficient Influence Maximization Room Optimization under Uncertainty - Thursday 5:00 PM – 6:30 PM Salle 32 Theoreticals and practicals aspects of decomposition algorithms for multistage stochastic problems: 2, Organizer: Vincent Leclère, session 247 Stoch Build B, Z 5 Ground Floor 4x20 min Oscar Dowson, The practitioners guide to SDDP: lessons from SDDP.jl Fran¸cois Pacaud, Decomposing Dynamic Programming equations: from global to nodal value functions Vitor de Matos, Energy portfolio opti- mization for Brazilian distribution compa- nies: a multistage Luiz Carlos da Costa Junior, Stochastic programming framework for risk aversion representation with SDDP Salle 30 Topics in multistage stochastic optimization, Chair: Felipe Beltrán, session 492 Stoch Build B, Z 5 Ground Floor 3x20 min Min Zhang, Risk Minimization, Regret Minimization and the Progressive Hedging Algorithm David Hemmi, Recursive Evaluate and Cut for combinatorial Multistage Programs Felipe Beltr´an, Stochastic dual dynamic programming with Chebyshev centers DENIGES Robust Optimization under Data Uncertainty, Organizer: Omid Nohadani, session 98 Robust Build C, Z 5 Ground Floor 3x30 min Matthias Ehrgott, Uncertain Data Envel- opment Analysis Soroosh Shafieezadeh, Wasserstein Distri- butionally Robust Kalman Filtering Zhenzhen Yan, Appointment Scheduling Under Time-Dependent Patient No-Show Behavior Salle 37 Combinatorial robust optimization I, Organizer: Marc Goerigk, session 167 Robust Build B, Z 4 Intermediate 4x20 min Artur Pessoa, Solving the Robust Capac- itated Vehicle Routing Problem Under De- mand Uncertainty Marc Goerigk, Approximating combi- natorial optimization problems with the OWA criterion Oyku Naz Attila, Reformulations for Ro- bust Lot-Sizing Problem with Remanufac- turing Christoph Hansknecht, ast robust shortest path computations Salle 31 Approximation in dynamic programming, Chair: Philip C Placek, session 382 Markov Build B, Z 5 Ground Floor 3x30 min Wolf Kohn, Dynamic Programming via a State Abstract Machine and Implementa- tion Philip Placek, An Incremental Probability Model for Dynamic Systems Benoˆit Tran, A Stochastic Min-plus Algo- rithm for Deterministic Optimal Control 91 Yüklə 23,3 Mb. Dostları ilə paylaş:
|