Mathematical Programming
Yüklə 23,3 Mb. Pdf görüntüsü
|
Room Discrete Optimization & Integer Programming - Friday 8:30 AM – 10:30 AM Salle 43 Recent advances in Integer Optimization, Organizer: Alberto Del Pia, session 218 IPtheory Build C, Z 1 3rd floor 4x30 min Jean-Philipp Richard, Computational eval- uation of new MIP models for tree ensem- bles optimization Diego Moran, Strong duality for conic mixed-integer programs Gustavo Angulo, An affine bounding method for two-stage stochastic integer programs Merve Bodur, Aggregation-based cutting- planes for packing and covering integer programs Salle 35 Mixed Integer Programming Representability, Organizer: Juan Pablo Vielma, session 275 IPtheory Build B, Z 4 Intermediate 4x30 min Chris Ryan, Mixed-integer linear repre- sentability, disjunctions, and Chvátal func- tions Joey Huchette, A mixed-integer branching approach for very small formulations Marc Pfetsch, On the Size of Integer Pro- grams with Sparse Constraints or Bounded Coe fficients Juan Pablo Vielma, Mixed-integer convex representability Salle 44 Integer Programming and Crew Scheduling, Organizer: Francois Soumis, session 292 IPpractice Build C, Z 1 3rd floor 4x30 min Francois Soumis, Dynamic Constraints Aggregation for Crew Scheduling Problem Vahid Zeighami, Integrated Crew Pairing and Personalized Crew Assignment Prob- lems Fr´ed´eric Quesnel, Considering prefer- ences and language skills in the airline crew pairings problem Mohammed Saddoune, Alternate La- grangian Decomposition for Integrated Crew Scheduling Problem Salle 34 Optimal Control Problems with Discrete Switches, Organizer: Christian Kirches, session 102 MINLP Build B, Z 3 1st floor 3x30 min Adrian B¨urger, An Algorithm for Model- Predictive Control of Switched Nonlinear Dynamic Systems Felix Bestehorn, Approximation algo- rithms for MIOCPs with discontinuous switch costs Matthias Schloeder, Numerical Modeling of Switched Systems with Jumps in Opti- mal Control Problems LEYTEIRE Data-Driven Revenue Management with Customer Choice, Organizer: Jacob Feldman, session 81 APPROX Build E, Z 1 3rd floor 4x30 min Antoine Desir, Constrained Assortment Optimization under the Markov Chain based Choice Model Danny Segev, Near-Optimal Approxima- tions for Dynamic Assortment Planning under the MNL Model Ali Aouad, Near-Optimal Approximations for Display Optimization Under MNL Preferences Jacob Feldman, New Results for Assort- ment Optimization under the Exponomial Choice Model Salle 36 Clustering., Organizer: Zac Friggstad, session 155 APPROX Build B, Z 4 Intermediate 4x30 min Arnaud de Mesmay, A Near-Linear Ap- proximation Scheme for Multicuts of Em- bedded Graphs Vincent Cohen-Addad, On local search for clustering Zac Friggstad, Approximation Schemes for Clustering With Outliers Ashkan Norouzi Fard, Dynamic Facility Location via Exponential Clocks SIGALAS Matching and scheduling, Organizer: Se ffi Naor, session 54 COMB Build C, Z 2 2nd floor 4x30 min David Wajc, Online Matching in Regular Graphs (and Beyond) Samir Khuller, Coflow Scheduling and beyond Guy Even, Best of Two Local Models: Centralized local and Distributed local Al- gorithms Seffi Naor, Competitive Algorithms for Online Multi-level Aggregation Salle 41 Recent progress in graph cut problems, Organizer: Karthekeyan Chandrasekaran, session 244 COMB Build C, Z 1 3rd floor 4x30 min Tam´as Kir´aly, Approximation of Linear 3- Cut and related problems Euiwoong Lee, An FPT Algorithm Beat- ing 2-Approximation for k-Cut Yury Makarychev, An Integrality Gap for the C˘alinescu–Karlo ff–Rabani Relaxation for Multiway Cut Karthekeyan Chandrasekaran, Hyper- graph k-cut in randomized polynomial time Salle 39 Algorithmic aspects of connectivity in network design, Organizer: Neil Olver, session 264 COMB Build E, Z 1 3rd floor 4x30 min Bundit Laekhanukit, Beyond Metric Em- bedding: Approximating Group Steiner on Bounded Treewidth Graphs Mateusz Lewandowski, Approximating Node-Weighted k-MST on Planar Graphs Andre Linhares, Improved Algorithms for MST and Metric-TSP Interdiction Kanstantsin Pashkovich, On the Integral- ity Gap of the Prize-Collecting Steiner For- est LP DURKHEIM Graphical Optimization Model 2, Organizer: Maria I. Restrepo, session 297 CP Build A, Z 1 3rd floor 4x30 min Simon de Givry, Recent algorithmic ad- vances for combinatorial optimization in graphical models Thomas Schiex, Learning and using Graph- ical models to design new molecules Maria Restrepo, Integrated staffing and scheduling for home healthcare Daniel Kowalczyk, Solving parallel ma- chine scheduling problems with B and P and decision diagrams Room Optimization under Uncertainty - Friday 8:30 AM – 10:30 AM DENIGES Theoreticals and practicals aspects of decomposition algorithms for multistage stochastic problems: 3, Organizer: Vincent Leclère, session 245 Stoch Build C, Z 5 Ground Floor 4x30 min David Morton, Distributionally Robust Dual Dynamic Programming Andy Sun, Stochastic dual dynamic integer programming Regan Baucke, A deterministic algorithm for solving stochastic minimax dynamic programmes Vincent Lecl`ere, Exact converging bounds for Stochastic Dual Dynamic Programming Salle 32 New methods for stochastic optimization and variational inequalities, Chair: Yunxiao Deng, session 491 Stoch Build B, Z 5 Ground Floor 4x30 min Alfredo Iusem, Extragradient method for pseudomonotone stochastic variational in- equalities Eduard Gorbunov, An Accelerated Ran- domized Method for Smooth Stochastic Convex Optimization Mihai Anitescu, Stochastic Analogues to Deterministic Optimization Methods Yunxiao Deng, Convex Stochastic De- composition and Applications to Machine Learning Salle 33 New Horizons in Robust Optimization, Organizer: Angelos Georghiou, session 447 Robust Build B, Z 5 Ground Floor 3x30 min Zhi Chen, Data-driven Chance Constrained Programs over Wasserstein Balls Kilian Schindler, Cardinality-Constrained Clustering and Outlier Detection via Conic Optimization Angelos Georghiou, A robust optimiza- tion prospective to decentralized decision making Salle 31 Advances in theory of dynamic programming, Chair: Stephane L Gaubert, session 385 Markov Build B, Z 5 Ground Floor 4x30 min Mauricio Junca, On controllability of Markov chains: A Markov Decision Pro- cesses approach Angeliki Kamoutsi, Stochastic Convex Optimization and Regret Bounds for Ap- prenticeship Learning Nabil Kahale, Randomized Dimension Reduction for Monte Carlo Simulations Nikolas Stott, Dynamic programming over noncommutative spaces applied to switched systems Salle 30 Algorithmic Game Theory II, Chair: Margarida Carvalho, session 372 Game Build B, Z 5 Ground Floor 4x30 min Anja Huber, Efficient Black-Box Reduc- tions for Separable Cost Sharing Marton Benedek, Finding and verifying the nucleolus of cooperative games Chuangyin Dang, Perfect d-Proper Equi- librium and Its Determination Margarida Carvalho, Kidney Exchange Game 94 Yüklə 23,3 Mb. Dostları ilə paylaş:
|