Mathematical Programming
Yüklə 23,3 Mb. Pdf görüntüsü
|
Room Specific Models, Algorithms, and Software - Wednesday 5:00 PM – 6:30 PM FABRE Problems in the intersection of machine learning and optimization, Chair: Ross M Anderson, session 328 Learning Build J, Z 8 Ground Floor 3x30 min Brandon Amos, OptNet: End-to-End Dif- ferentiable Constrained Optimization Ross Anderson, Solving argmax for a neu- ral network with MIP, and related opti- mization problems Vinod Nair, Learning Fast Optimizers for Contextual Stochastic Integer Programs Salle 22 Large-scale convex optimization, Chair: Alexander V. Rogozin, session 479 Learning Build G, Z 6 2nd floor 2x20 min Alexander Rogozin, Optimal distributed convex optimization on slowly time- varying graphs Tommaso Colombo, Leverage data struc- ture to improve Stochastic Gradient De- scent algorithm Salle 24 Location and Routing, Chair: Mustapha Oudani, session 451 Logistics Build G, Z 6 3rd floor 4x20 min Imen Ben Mohamed, Stochastic Two- echelon Location-Routing Rasul Esmaeilbeigi, Benders decomposi- tion for a hierarchical facility location problem Nicolas K¨ammerling, Benders Decompo- sition for Uncertain Hub Location with Variable Allocation Mustapha Oudani, The Incomplete Hub Location and Routing Problem Salle 16 Production-Routing, Chair: Feng Gao, session 456 Logistics Build I, Z 7 2nd floor 3x20 min Feng Gao, Models and Algorithms for Ro- bust Production Routing Under Demand Uncertainty Saranthorn Phusingha, Meta-Heuristics for Multi-Period Sales Districting Problem Yuzhuo Qiu, Models and Algorithms for Stochastic and Robust Production Routing with Time Win Salle 18 Machine Scheduling 2, Chair: Guopeng Song, session 529 Scheduling Build I, Z 7 1st floor 3x20 min Cristiane Ferreira, Human-Robot Scheduling in Collaborative Environments Margaux Nattaf, Parallel machine scheduling with time constraints on machine qualifications Guopeng Song, The robust machine avail- ability problem Salle DENUCE Optimization and modeling of integrated energy systems, Organizer: Jalal Kazempour, session 71 Energy Build Q, Z 8 Ground Floor 4x20 min Stefanos Delikaraoglou, Market-based valuation of natural gas network flexibility Ibrahim Abada, Unintended consequences: The snowball e ffect of energy communities Lesia Mitridati, Coordination of Heat and Electricity Systems via Market-Based Mechanisms Anna Schwele, Virtual bidders and self- schedulers in electricity and natural gas markets Salle 23 Energy Market Models, Chair: Sauleh A Siddiqui, session 522 Energy Build G, Z 6 3rd floor 3x30 min Thomas Kleinert, Global Optimization of Multilevel Electricity Market Models Emre Celebi, Co-optimization Models with Market-Clearing Equilibrium: A Ro- bust Approach Sauleh Siddiqui, Solving Problems with Equilibrium Constraints Applied to Energy Markets Salle LA4 Resource-constrained assignment and scheduling, Organizer: Fabian Bastin, session 398 Sciences Build L, Z 8 Basement 3x30 min Giorgio Sartor, A novel formulation for job-shop scheduling in tra ffic management Vipin Vijayalakshmi, Improving local search for distributed resource allocation and equilibrium. Fabian Bastin, A learning-based approach for multi-skill sta ffing optimization in call centers PITRES Progress in MIP Solvers II, Organizer: Hans Mittelmann, session 234 Algo Build O, Z 8 Ground Floor 3x30 min Andrea Tramontani, Benders Decomposi- tion in IBM CPLEX Michael Winkler, Gurobi 8.0 - What’s new Michael Perregaard, Recent Progress in the Xpress Solvers Room Invited Talks - Wednesday 5:00 PM – 6:30 PM SIGALAS Solvers and softwares, Chair: François Clautiaux, session 390 INTERFACE Build C, Z 2 2nd floor 4x20 min Julien Darlay, Solving packing, rout- ing and scheduling problems using Local- Solver Pawel Lichocki, Applied mixed integer programming: The why and how Robert Luce, Solving MIPs with Gurobi Instant Cloud Johannes M¨uller, Creating an optimiza- tion web app with FICO Xpress 85 Room Discrete Optimization & Integer Programming - Thursday 8:30 AM – 10:30 AM Salle 34 Integer linear programming, convex geometry, and lattices , Organizer: Sinai Robins, session 142 IPtheory Build B, Z 3 1st floor 4x30 min Achill Sch¨urmann, Exploiting Linear Symmetries in Integer Convex Optimiza- tion Matthias Schymura, On the reverse isodi- ametric problem Kevin Woods, The Complexity of Pres- burger Arithmetic in Fixed Dimension Sinai Robins, Fourier transforms of poly- topes, solid angle sums, and discrete vol- umes Salle 35 Convexity and Polytopes, Chair: David Warme, session 518 IPtheory Build B, Z 4 Intermediate 4x30 min Emiliano Lancini, Box-Total Dual Integral- ity and k-Edge-Connectivity Tamon Stephen, On the Circuit Diameter Conjecture Filipe Cabral, The role of extreme points for convex hull operations. David Warme, Metrics for Strength of In- equalities with Respect to a Polytope Salle 44 Advanced Linear(ized) MIP Formulations for Zero-One Programs, Organizer: Sven Mallach, session 127 IPpractice Build C, Z 1 3rd floor 4x30 min Leon Eifler, Mixed-Integer Programming for Clustering in Non-reversible Markov Processes Adalat Jabrayilov, A new ILP for the Steiner Tree Problem with Revenues, Bud- get and Hop Constraints Daniel Schmidt, An extended formulation for the Steiner Forest Problem Sven Mallach, Compact Linearization for Zero-One Quadratic Programs LEYTEIRE Submodular Maximization, Organizer: Moran Feldman, session 29 APPROX Build E, Z 1 3rd floor 4x30 min Moran Feldman, Deterministic and Com- binatorial Algorithms for Submodular Maximization Baruch Schieber, Constrained Submodu- lar Maximization via Greedy Local Search Simon Bruggmann, Submodular Maxi- mization through the Lens of Linear Pro- gramming Niv Buchbinder, Constrained Submodular Maximization via a Non-symmetric Tech- nique Salle 43 Cycles and Trees, Organizer: Tobias Mömke, session 90 APPROX Build C, Z 1 3rd floor 4x30 min Alantha Newman, Coloring and Dominat- ing Set on Digraphs with Bounded Inde- pendence Number Antonios Antoniadis, A PTAS for TSP with Hyperplane Neighborhoods L´aszl´o Kozma, Maximum Scatter TSP in doubling metrics Ralf Klasing, Approximabilty of Hub Al- location Problems Salle 36 Bin Packing, Chair: Frits CR Spieksma, session 344 APPROX Build B, Z 4 Intermediate 4x30 min Nadia Brauner, Automatically computed bounds for the online bin stretching prob- lem Leah Epstein, Batched bin packing Shlomo Karhi, Online Packing of Arbi- trary Size Items into Designated and Mul- tipurpose Bins Frits Spieksma, Partitioning Vectors into Quadruples Salle 41 Graphs and clutters, Organizer: Gerard Cornuejols, session 263 COMB Build C, Z 1 3rd floor 4x30 min Guoli Ding, Packing cycles in a tourna- ment Sharat Ibrahimpur, Min-Max Theorems for Packing and Covering Odd (u,v)-trails Ahmad Abdi, Cuboids, a class of clutters Dabeen Lee, Deltas, extended odd holes and their blockers Salle 39 Graph theory, Chair: Thomas Bellitto, session 422 COMB Build E, Z 1 3rd floor 4x30 min Isabel Beckenbach, A Tight Cut Decompo- sition for Hypergraphs with Perfect Match- ings Xujin Chen, Densities, Matchings, and Fractional Edge-Colorings Yutaro Yamaguchi, Making Bipartite Graphs DM-irreducible Thomas Bellitto, Optimal weighting to minimize the independence ratio of a graph DURKHEIM Parallel Computing and Sustainability, Organizer: Bistra Dilkina, session 296 CP Build A, Z 1 3rd floor 4x30 min Fei Fang, Designing the game to play in se- curity and sustainability domains Nahid Jafari, A Robust Optimization Model for an Invasive Species Manage- ment Problem Salvador Abreu, Parallel HYbridization for Simple Heuristics Ciaran McCreesh, Parallel Search, Order- ing, Reproducibility, and Scalability Salle 47 Performance Analysis, Organizer: Charlotte Truchet, session 298 CP Build A, Z 1 3rd floor 4x30 min Lars Kotthoff, The Shapley Value and the Temporal Shapley Value for Algorithm Analysis Guilhem Semerjian, Phase transitions in random constraint satisfaction problems Charlotte Truchet, A probabilistic study of the propagation of the AllDi fferent con- straint Alexander Tesch, Improving Energetic Propagations for Cumulative Scheduling Room Optimization under Uncertainty - Thursday 8:30 AM – 10:30 AM DENIGES New results in chance-constrained optimization, Chair: Bismark Singh, session 489 Stoch Build C, Z 5 Ground Floor 4x30 min Abebe Geletu, Smoothing Methods for Chance Constrained Optimization of Ellip- tic PDE Systems Ren´e Henrion, Dynamic chance con- straints under random distributiond Armin Hoffmann, Differentiabilty of joint chance constraints under weakened LICQ Bismark Singh, Approximating Chance Constrained Programs using Classical In- equalities Salle 32 Topics in multistage and integer stochastic optimization, Organizer: Jim Luedtke, session 490 Stoch Build B, Z 5 Ground Floor 4x30 min Ozge Safak, Three-Stage Stochastic Air- line Scheduling Problem Mehdi Karimi-Nasab, State space analysis of a stochastic DP to deal with curse of di- mensionality Cong Han Lim, Partitioned Subgradient Methods for Stochastic Mixed Integer Pro- gram duals Jim Luedtke, Lagrangian dual decision rules for multistage stochastic integer pro- grams Salle 37 K-adaptability, Organizer: Anirudh Subramanyam, session 1 Robust Build B, Z 4 Intermediate 4x30 min Jannis Kurtz, Min-max-min Robust Opti- mization for the Capacitated Vehicle Rout- ing Problem Michael Poss, Min-Max-Min Robustness for Combinatorial Problems with Bud- geted Uncertainty Jonas Pruente, K-Adaptibility in Stochas- tic Programming Anirudh Subramanyam, K-Adaptability in Two-Stage Mixed-Integer Robust Opti- mization Salle 33 New applications of robust optimizations, Chair: Mirjam Duer, session 461 Robust Build B, Z 5 Ground Floor 3x30 min Jorge Vera, Condition and geometric measures for consistency in intertemporal optimization Alec Koppel, Compositional Stochastic Optimization with Kernels for Robust On- line Learning Mirjam Duer, Robust Approach for Strati- fied Sampling Allocation Problems Salle 30 Stackelberg Games, Chair: Stefano Coniglio, session 374 Game Build B, Z 5 Ground Floor 4x30 min Jean-Bernard Eytard, Tropical geometry applied to bilevel programming Stefan Waldherr, Bilevel Programming for Combinatorial Exchanges with Budget Constraints Stefano Coniglio, Computing Pessimistic Leader-Follower Equilibria with Multiple Followers Francesco Caruso, A learning approach for selection of subgame perfect Nash equilibria 86 Yüklə 23,3 Mb. Dostları ilə paylaş:
|