Mathematical Programming
Yüklə 23,3 Mb. Pdf görüntüsü
|
Room Specific Models, Algorithms, and Software - Friday 8:30 AM – 10:30 AM FABRE Dimensionality reduction tools for learning: A sketchy session, Organizer: Robert M Gower, session 313 Learning Build J, Z 8 Ground Floor 3x30 min Nicolas Keriven, Sketched Learning with Random Feature Moments Arthur Mensch, Stochastic Subsampling for Factorizing Huge Matrices Alessandro Rudi, Optimal kernel methods for large scale machine learning Salle 16 Dealing with non-convexity, Chair: Damek Davis, session 473 Learning Build I, Z 7 2nd floor 4x30 min Leonard Berrada, Smoothing Piecewise Linear Loss Functions for Deep Learning Damek Davis, Convergence rates of stochastic methods for nonsmooth non- convex problems Cong Ma, Implicit Regularization in Non- convex Statistical Estimation Naoki Marumo, Provable Convex Mini- mization under Non-convex Submodular- structured Sparsity Salle 18 Telecommunications, Organizer: Edoardo Amaldi, session 361 Network Build I, Z 7 1st floor 4x30 min Michal Pioro, An Optimization Model for Quadratic Flow Thinning Matthias Rost, Approximating the Virtual Network Embedding Problem: Theory and Practice Chafiq Titouna, DDRA: Distributed De- tection and Recovery Algorithm for Wire- less Sensor Networks Edoardo Amaldi, On the Virtual Network Embedding problem with substrate net- work expansion PITRES Hybrid Algorithms and Matheuristics for VRP, Organizer: Thibaut Vidal, session 181 Logistics Build O, Z 8 Ground Floor 4x30 min Thibaut Vidal, Heuristics for vehicle rout- ing problems: Sequence or set optimiza- tion? Dominique Feillet, Single Liner Service Design with Speed Optimization Jean Bertran Gauthier, Heuristic pricing for the shortest path problem with resource constraints Pedro Diniz, Garbage Collection Routing With Heterogeneous Fleet Salle 23 Scheduling Applications, Chair: Mauricio C. de Souza, session 526 Scheduling Build G, Z 6 3rd floor 3x30 min Atsuko Ikegami, Generating many optimal solutions in nurse scheduling Davaatseren Baatar, Mixed Integer Pro- gramming Based Merge Search for Open Pit Block Scheduling Mauricio de Souza, Surgical scheduling under uncertainty by approximate dynamic programming Salle 24 Power Systems Models with Discrete Decision Variables, Organizer: Adolfo R Escobedo, session 26 Energy Build G, Z 6 3rd floor 3x30 min Kai Pan, Co-optimizing Energy and Ancil- lary Services Harsha Gangammanavar, Stochastic Framework for Coordinated Operation of Multiple Microgrids Adolfo Escobedo, Generation of Angular Valid Inequalities for Transmission Expan- sion Planning Salle DENUCE Machine Learning in State Estimation and Situational Awareness in Power Grids, Organizer: Deepjyoti Deka, session 134 Energy Build Q, Z 8 Ground Floor 4x30 min Deepjyoti Deka, Learning with end-users in distribution grids:Topology and parame- ter estimation Marc Vuffray, Online Learning of Power Transmission Dynamics Mauro Escobar, Machine learning with PMU signals Dongchan Lee, Convex polytope machine approach for transient stability assessment Salle LA4 Finance and Portfolio Optimization, Organizer: Asaf Shupo, session 395 Sciences Build L, Z 8 Basement 3x30 min Benjamin Heymann, Auction under ROI constraints Gabriela Kovacova, Time Consistency of the Mean-Risk Problem Asaf Shupo, Building Optimal Strategies Using Multi-Objective Optimization Salle 22 New Developments in Optimization Modeling Software, Organizer: Robert Fourer, session 101 Algo Build G, Z 6 2nd floor 4x30 min Steven Dirkse, Enhanced Model Deploy- ment and Solution in GAMS David Gay, Adding Functions to AMPL Paul Kerr-Delworth, Optimization Mod- eling in MATLAB Youngdae Kim, Efficient model generation for decomposition methods in modeling languages Room Invited Talks - Friday 11:00 AM – 12:00 AM Auditorium Tseng Memorial Lectureship in Continuous Optimization, Organizer: Yaxiang Yuan, session 549 SEMI Build Symph H, Z 0 Gambetta 1x60 min LEYTEIRE Majority judgment , Organizer: Martine Labbé, session 535 KEYNOTE Build E, Z 1 3rd floor 1x60 min Michel Balinski, Majority judgment DENIGES Submodularity in mixed-integer quadratic and conic quadratic optimization, Organizer: Daniel Bienstock, session 540 KEYNOTE Build C, Z 5 Ground Floor 1x60 min Alper Atamturk, Submodularity in mixed-integer quadratic and conic quadratic optimization BROCA Modern Branch-and-Cut Implementation, Organizer: Marc E Pfetsch, session 542 KEYNOTE Build W, Z 0 3rd floor 1x60 min Matteo Fischetti, Modern Branch-and- Cut Implementation Room Invited Talks - Friday 1:30 PM – 2:30 PM Auditorium Bounds for quantum graph parameters by conic and polynomial optimization, Organizer: Frank Vallentin, session 553 PLENARY Build Symph H, Z 0 Gambetta 1x60 min Monique Laurent, Bounds for quantum graph parameters by conic and polynomial optimization 96 Room Discrete Optimization & Integer Programming - Friday 3:15 PM – 4:45 PM Salle 34 Polyhedral theory in practice, Organizer: Mourad Baiou, session 309 IPtheory Build B, Z 3 1st floor 3x30 min Rafael Colares, The Stop Number Mini- mization Problem: polyhedral analysis Francisco Barahona, On the nucleolus of shortest path and network disconnection games Mourad Baiou, On some network security games Salle 42 Extended Formulations, Chair: Bartosz Filipecki, session 514 IPtheory Build C, Z 1 3rd floor 3x30 min Bernd Perscheid, An Extended Formula- tion for the 1-Wheels of the Stable Set Polytope Mirjam Friesen, Extended formulations for higher-order spanning tree polytopes Bartosz Filipecki, Stronger Path-based Extended Formulation for the Steiner Tree Problem Salle 44 Routing, Chair: Cole Smith, session 484 IPpractice Build C, Z 1 3rd floor 3x30 min Imke Joormann, Solving the Time- Dependent TSP using Machine Learning Guidance Ann-Brith Str¨omberg, Column genera- tion for routing a fleet of plug-in hybrid ve- hicles Cole Smith, The consistent path problem and binary decision diagrams Salle 36 IP Practice III, Chair: Samuel S Brito, session 507 IPpractice Build B, Z 4 Intermediate 3x30 min Franco Quezada, Valid inequalities for solving a stochastic lot-sizing problem with returns Samuel Brito, Improving COIN-OR CBC MIP Solver Using Conflict Graphs Maximilian John, Two Lower Bound Ap- proaches for the Keyboard Layout Problem Salle 39 Outer Convexification and Mixed-Integer Optimal Control , Organizer: Sebastian Sager, session 103 MINLP Build E, Z 1 3rd floor 3x30 min Paul Manns, Improved Regularity As- sumptions for Partial Outer Convexifica- tion of MIPDECOs Clemens Zeile, Combinatorial Integral Ap- proximation Decompositions for Mixed- Integer Control Oliver Habeck, Global optimization of ODE constrained network problems DURKHEIM Intersection cuts, disjunctions, and valid inequalities, Organizer: Eli Towle, session 180 MINLP Build A, Z 1 3rd floor 3x30 min Daniel Bienstock, Outer-product-free Sets for Polynomial Optimization Egon Balas, Synthetizing branch-and- bound information into cutting planes Eli Towle, Intersection disjunctions for re- verse convex sets Salle 35 Branch-and-cut techniques, Organizer: Teodora Dan, session 277 MINLP Build B, Z 4 Intermediate 3x30 min Teodora Dan, A branch-and-bound al- gorithm for a bilevel location-allocation model Lovis Anderson, Improving branching for disjunctive models via approximate convex decompositions Tu Nguyen, Learning with Cutting Planes LEYTEIRE Submodular Maximization., Organizer: Justin Ward, session 179 APPROX Build E, Z 1 3rd floor 3x30 min Ilija Bogunovic, Robust Maximization of Submodular Objs. in the Presence of Ad- versarial Removals Alfredo Torrico, Robust submodular maximization under matroid constraints Amin Karbasi, Submodular Optimization: From Discrete to Continuous and Back Salle 43 Submodular and Incremental Maximization, Organizer: Martin Gross, session 340 APPROX Build C, Z 1 3rd floor 3x30 min Rajan Udwani, Multi-objective Maximiza- tion of Monotone Submodular Functions Tasuku Soma, A New Approximation Guarantee for Submodular Maximization via Discrete Convexity Martin Gross, General Bounds for Incre- mental Maximization SIGALAS Combinatorial aspects of Linear Programming, Organizer: Daniel Dadush, session 259 COMB Build C, Z 2 2nd floor 3x30 min Sophie Huiberts, A Friendly Smoothed Analysis of the Simplex Method Giacomo Zambelli, Geometric Rescaling Algorithms for Submodular Function Min- imization Neil Olver, A Simpler and Faster Strongly Polynomial Algorithm for Generalized Max-Flow Room Optimization under Uncertainty - Friday 3:15 PM – 4:45 PM Salle 32 Risk-aware decision making, Organizer: Minseok Ryu, session 251 Stoch Build B, Z 5 Ground Floor 3x30 min Hideaki Nakao, Medical Homecare Deliv- ery with Time-dependent Stochastic Travel Time Zheng Zhang, A stochastic programming approach for optimization of latent disease detection Minseok Ryu, Nurse staffing under uncer- tain demand and absenteeism Salle 33 Distributionally Robust Optimization: Models and Applications, Organizer: Selin D Ahipasaoglu, session 355 Robust Build B, Z 5 Ground Floor 3x30 min Bikramjit Das, Heavy tails in a moment- constrained robust newsvendor model Henry Lam, Robust Extreme Event Analy- sis Selin Ahipasaoglu, Concentration versus Diversification in Portfolio Selection DENIGES Distributionally Robust Optimization, Organizer: Daniel Kuhn, session 446 Robust Build C, Z 5 Ground Floor 3x30 min Napat Rujeerapaiboon, Chebyshev In- equalities for Products of Random Vari- ables Johannes Royset, Variational Theory for Optimization under Stochastic Ambiguity Daniel Kuhn, Distributionally Robust In- verse Covariance Estimation Salle 31 Discrete stochastic dynamic programming, Chair: Adam Narkiewicz, session 384 Markov Build B, Z 5 Ground Floor 3x30 min Victor Cohen, MILP formulations for dis- crete stochastic optimization (LIMIDs) Axel Parmentier, LP relaxations for dis- crete stochastic optimization with varia- tional inference Adam Narkiewicz, A sequential decision process with stochastic action sets Salle 30 Scalarization, representation and the comparison of methods in Multiobjective Optimization, Chair: Tyler Perini, session 378 Game Build B, Z 5 Ground Floor 3x30 min Kenza Oufaska, New scalarization tech- nique for solving multi-objective problems Tyler Perini, Approximation of the fron- tier for a biobjective MIP: comparison be- tween methods Kateryna Muts, Multi-Objective Opti- mization for the Compiler of Hard Real- Time Systems 97 Yüklə 23,3 Mb. Dostları ilə paylaş:
|