Mathematical Programming
Yüklə 23,3 Mb. Pdf görüntüsü
|
Room Discrete Optimization & Integer Programming - Wednesday 3:15 PM – 4:45 PM Salle 44 Knapsack Problems, Organizer: Enrico Malaguti, session 185 IPpractice Build C, Z 1 3rd floor 3x30 min Ashwin Arulselvan, Algorithms for bilevel knapsack problem Orlando Rivera-Letelier, Cutting Planes for the Multi-Modal Precedence Con- strained Problem Enrico Malaguti, The Fractional Knap- sack Problem with Penalties Salle 36 Decomposition I, Chair: Dieter Weninger, session 486 IPpractice Build B, Z 4 Intermediate 3x30 min Kerem Bulbul, Benders Decomposition and Column-and-Row Generation for LPs w /Column-Dependent Rows Paul Stursberg, Improved Cut Selection for Benders Decomposition Dieter Weninger, A Penalty Alternating Direction Decomposition Framework for MIPs DURKHEIM Decomposition methods for MINLP, Organizer: Ivo Nowak, session 55 MINLP Build A, Z 1 3rd floor 3x30 min Ivo Nowak, Decomposition-based Succes- sive Approximation Methods for MINLP Pavlo Muts, Decogo - A new decomposition-based MINLP solver Eligius Hendrix, On simplicial monotonic- ity and dimension reduction in MINLP Salle 34 MINLP (II), Organizer: Daniel Bienstock, session 66 MINLP Build B, Z 3 1st floor 3x30 min Akshay Gupte, Polyhedral relaxations for nonconvex quadratic functions Mohit Tawarmalani, Product convexifica- tion: A new relaxation framework for non- convex programs Javad Lavaei, Sparse conic optimization: low-rank solutions and near-linear time al- gorithms Salle 35 MINLP for Data Science, Organizer: Vanesa Guerrero, session 108 MINLP Build B, Z 4 Intermediate 3x30 min Sandra Ben´itez-Pe˜na, Cost-sensitive SVM Cristina Molero-R´io, Optimizing classifi- cation trees via non-linear continuous pro- gramming Vanesa Guerrero, MINLP to visualize dy- namic proximities and frequencies LEYTEIRE Clustering, Organizer: Mohammad R Salavatipour, session 30 APPROX Build E, Z 1 3rd floor 3x30 min Aravindan Vijayaraghavan, Clustering Mixtures of Well-Separated Gaussians Konstantin Makarychev, Correlation Clustering Melanie Schmidt, Analysis of Ward’s method Salle 43 Network Design and Routing, Chair: Yuko Kuroki, session 346 APPROX Build C, Z 1 3rd floor 3x30 min Yusa Matsuda, A 4-approximation algo- rithm for k-prize collecting Steiner tree problems Yuko Kuroki, Approximation algorithm for star-star hub-and-spoke network design problems Jeremy Omer, Time-dependent shortest path with discounted waiting Salle 41 Variants of the Assignment problem, Organizer: Kavitha Telikepalli, session 266 COMB Build C, Z 1 3rd floor 3x30 min Tobias M¨omke, Approximating Airports and Railways Ami Paz, A (2+eps)-Approximation for Maximum Weight Matching in the Semi- Streaming Model Kavitha Telikepalli, Popularity, Mixed Matchings, and Self-duality Salle 39 Polyhedral aspects of combinatorial optimization problems, Chair: Guillerme Duvillié, session 404 COMB Build E, Z 1 3rd floor 3x30 min Shungo Koichi, A polyhedral insight into covering a 2 /3 supermodular function by a graph Sergei Chubanov, Alternating contractions and their combinatorial applications Guillerme Duvilli´e, Comparison of some symmetry breaking techniques for graph coloring problem Room Optimization under Uncertainty - Wednesday 3:15 PM – 4:45 PM Salle 32 Learning and Stochastic Programming, Organizer: Matthias Poloczek, session 254 Stoch Build B, Z 5 Ground Floor 3x30 min Junyi Liu, Asymptotic Results For Two- stage Stochastic Quadratic Programming Haoxiang Yang, Optimizing Crashing De- cisions in a Project Management Problem with Disruptions Matthias Poloczek, Bayesian Optimiza- tion of Combinatorial Structures DENIGES Dynamic Optimization: Theory and Algorithms, Organizer: Vineet Goyal, session 100 Robust Build C, Z 5 Ground Floor 3x30 min Shimrit Shtern, A Scalable Algorithm for Two-Stage Adaptive Linear Optimization Bradley Sturt, Data-Driven Multi-Stage Adaptive Optimization Vineet Goyal, Optimal Approximation via A ffine Policies for Two-stage Robust Opti- mization Salle 37 Cursing the Dimensionality: Two-Stage and Multi-Stage Robust Optimization, Organizer: Angelos Tsoukalas, session 443 Robust Build B, Z 4 Intermediate 3x30 min Chin Pang Ho, Efficient Algorithms for Ro- bust MDPs with State Rectangularity Frans de Ruiter, Dual approach for two- stage robust nonlinear optimization models Angelos Tsoukalas, Robust Dual Dy- namic Programming Salle 31 Dynamic programming applications, Chair: Susanne Ho ffmeister, session 379 Markov Build B, Z 5 Ground Floor 2x30 min Susanne Hoffmeister, Markov Decision Processes for Sport Strategy Optimization Paolo Serafini, A Model to evaluate the cost-e ffectiveness trade-off for urologic treatments Salle 30 Nonconvex and Complex Problems in Multiobjective Optimization, Chair: Gabriele Eichfelder, session 268 Game Build B, Z 5 Ground Floor 3x30 min Gabriele Eichfelder, A Trust Region Method for Heterogeneous Multiobjective Optimization Elizabeth Karas, Multiobjective program- ming via bundle methods Tommaso Levato, Sparse multiobjective optimization via concave approximations 81 Yüklə 23,3 Mb. Dostları ilə paylaş:
|