Mathematical Programming
Yüklə 23,3 Mb. Pdf görüntüsü
|
Room Invited Talks - Tuesday 3:15 PM – 4:45 PM SIGALAS A.W. Tucker Prize Session, Chair: Simge Kucukyavuz, session 559 INTERFACE Build C, Z 2 2nd floor Room Discrete Optimization & Integer Programming - Wednesday 8:30 AM – 10:30 AM Salle 43 Determinantal structures of IPs, Organizer: Martin Henk, session 131 IPtheory Build C, Z 1 3rd floor 4x30 min Stephan Artmann, Width in congruency- constrained TU-systems. Friedrich Eisenbrand, Faster algorithms for Integer Programming using the Steinitz Lemma Christoph Glanzer, On the number of dis- tinct rows of a matrix with bounded sub- determinants Robert Weismantel, Distances between LPs, IPs and MIPs Salle 35 Advances in Integer Programming, Organizer: Santanu S Dey, session 230 IPtheory Build B, Z 4 Intermediate 4x30 min Sanjeeb Dash, A generalization of Gomory-Chvatal cuts Burak Kocuk, Integer Programming Tech- niques for Optimal Transmission Switch- ing Problems Alejandro Toriello, Time-indexed Relax- ations for the Online Bipartite Matching Problem Laurence Wolsey, Constant Capacity Flow Cover Inequalities on a Path or a Variant of Lot-Sizing Salle 42 Primal Algorithms for Integer Programming Problems, Organizer: Daniel Aloise, session 338 IPtheory Build C, Z 1 3rd floor 4x30 min Adil Tahir, Integral Column Generation Algorithm for Set Partitioning Type Prob- lems Omar Foutlane, Distributed Integral Sim- plex Using Decomposition for Set Parti- tioning Problems Ilyas Himmich, A Polyhedral Study of the Shortest Path Problem with Resource Con- straints Daniel Aloise, A scalable algorithm for the solution of large clustering problems Salle 44 Benders Decomposition for Combinatorial and Bilevel Optimization, Organizer: Fabio Furini, session 171 IPpractice Build C, Z 1 3rd floor 4x30 min Arthur Mah´eo, A Framework for Benders with Integer Sub-Problem Paolo Paronuzzi, New ILP formulations for the k-Vertex Cut Problem Ivana Ljubic, Decomposition Approaches to Covering Location Problems Fabio Furini, The Maximum Clique Inter- diction Game Salle 34 MINLP (I), Organizer: Daniel Bienstock, session 65 MINLP Build B, Z 3 1st floor 3x30 min Bachir El Khadir, Time-Varying Semidef- inite Programs Kurt Anstreicher, Strengthened Relax- ations for Quadratic Optimization with Switching Variables James Renegar, A Simple Nearly-Optimal Restart Scheme For Speeding-Up First Or- der Methods LEYTEIRE Approximation Algorithms for the Traveling Salesman Problem, Organizer: Anke van Zuylen, session 23 APPROX Build E, Z 1 3rd floor 4x30 min Stephan Held, Vehicle Routing with Sub- tours Kent Quanrud, Fast Approximations for Metric TSP Jens Vygen, The s-t-path TSP: past, present, and future Anke van Zuylen, The Salesman’s Paths: Layered Christofides’ Trees, Deletion and Matroids Salle 36 Approximation Algorithms for Scheduling Problems, Organizer: Nicole Megow, session 72 APPROX Build B, Z 4 Intermediate 4x30 min Ruben Hoeksma, The general scheduling problem with uniform release dates is not APX-hard Clifford Stein, Minimizing Maximum Flow Time on Related Machines via Dy- namic Pricing Sven J¨ager, Generalizing the Kawaguchi- Kyan Bound to Stochastic Parallel Ma- chine Scheduling Julian Mestre, Precedence-Constrained Min Sum Set Cover Salle 41 Discrete Convex Analysis, Organizer: Akiyoshi Shioura, session 243 COMB Build C, Z 1 3rd floor 4x30 min Akiyoshi Shioura, M-convex Function Minimization under L1-distance Con- straint Eric Balkanski, On the Construction of Substitutes Fabio Tardella, Discrete Midpoint Con- vexity Satoko Moriguchi, Scaling, proximity, and optimization of integrally convex functions Salle 39 Optimization under uncertainty, Organizer: Marco Molinaro, session 261 COMB Build E, Z 1 3rd floor 4x30 min William Umboh, Online Probabilistic Met- ric Embedding and its Applications Ravishankar Krishnaswamy, Online and Dynamic Algorithms for Set Cover Sahil Singla, Algorithms and Adaptivity Gaps for Stochastic Probing Marco Molinaro, Online and Random- order Load Balancing Simultaneously DURKHEIM Learning in CP, Organizer: Arnaud Lallouet, session 301 CP Build A, Z 1 3rd floor 4x30 min Nadjib Lazaar, Constraint acquisition Arnaud Lallouet, Reasoning with Learned Constraints Arnaud Gotlieb, Boundary Estimation: Learning Boundaries for Constraint Opti- mization Problems Michela Milano, Empirical Model Learn- ing: boosting optimization through ma- chine learning Room Optimization under Uncertainty - Wednesday 8:30 AM – 10:30 AM DENIGES Chance Constraint and Its Applications, Organizer: Jianqiang Cheng, session 253 Stoch Build C, Z 5 Ground Floor 4x30 min Abdel Lisser, Joint chance constrained general sum games Jia Liu, Distributionally robust geometric programs with chance constraints Francesca Maggioni, Bounds for proba- bilistic constrained problems Jianqiang Cheng, Partial Sample Average Approximation Method for Chance Con- strained Problems Salle 32 Sampling and stability in stochastic optimization, Chair: Harsha Honnappa, session 488 Stoch Build B, Z 5 Ground Floor 3x30 min Edward Anderson, Distributional Robust- ness and Sample Average Approximation Matthias Claus, On stability of stochastic bilevel programs with risk aversion Gerard Cornuejols, From Estimation to Optimization via Shrinkage Salle 37 Interfaces of Applied Probability and Optimization, Organizer: Omar El Housni, session 409 Robust Build B, Z 4 Intermediate 4x30 min Julien Grand Clement, Robust Markov Decision Process: Beyond (and back to) Rectangularity Omar El Housni, Beyond Worst-case: A Probabilistic Analysis of A ffine Policies Omid Nohadani, Sustainable Inventory With Robust Periodic-a ffine Policies and Med. Supply Chains Karthik Natarajan, Distributionally Ro- bust Markovian Tra ffic Equilibrium Salle 33 Robust combinatorial optimization IV, Chair: Arie Koster, session 449 Robust Build B, Z 5 Ground Floor 4x30 min Pedro Munari, The vehicle routing prob- lem under uncertainty via robust optimiza- tion Marina Leal, A time-dependent version of the robust TSP and SPP. Arie Koster, Scheduling Jobs under Un- certainty: A Customer-oriented Approach Roberto Wolfler Calvo, Optimizing the electricity production planning with stochastic outage durations Salle 30 Risk and Financial Markets, Chair: Markku J Kallio, session 377 Game Build B, Z 5 Ground Floor 4x30 min Stefano Nasini, Bilevel programming ap- proach for investment strategies under in- termediation Yang Zhan, A smooth path-following method for computing equilibria in incom- plete markets Markku Kallio, Cooperative Mitigation of Contagion in Financial Networks Zhenyu Hu, Stable Risk Sharing and Its Monotonicity 78 Yüklə 23,3 Mb. Dostları ilə paylaş:
|