Mathematical Programming
Yüklə 23,3 Mb. Pdf görüntüsü
|
Room Specific Models, Algorithms, and Software - Monday 5:00 PM – 6:30 PM FABRE Riemannian geometry in optimization for learning, Organizer: Nicolas Boumal, session 320 Learning Build J, Z 8 Ground Floor 4x20 min Nicolas Boumal, Global rates of conver- gence for nonconvex optimization on man- ifolds Ronny Bergmann, A parallel Douglas- Rachford algorithm for data on Hadamard manifolds Paul Breiding, Riemannian optimization for the canonical tensor rank approxima- tion problem Junyu Zhang, Primal-Dual Optimization Algorithms over Riemannian Manifolds Salle DENUCE Exploiting structure in constrained optimization, Organizer: Mihai Cucuringu, session 334 Learning Build Q, Z 8 Ground Floor 4x20 min Hemant Tyagi, Provably robust estimation of modulo 1 samples of a smooth function Akiko Takeda, Efficient DC Algorithm for constrained sparse optimization problems Nikitas Rontsis, Distributionally Ambigu- ous Optimization Techniques for Batch Bayesian Optimizati Andre Uschmajew, On critical points of quadratic low-rank matrix optimization problems Salle 22 Sparsity, variable selection and e fficient algorithms, Chair: Alex Sholokhov, session 475 Learning Build G, Z 6 2nd floor 4x20 min Sam Tajbakhsh, Distributed algorithms for statistical learning with structured sparsity Jean Pauphilet, Sparse regression: Scal- able algorithms and empirical performance Alex Sholokhov, Sparsified Huge-Scale Optimization for Regularized Regression Problems Zixin Shen, Forward stepwise variable se- lection based on relative weights Salle 16 Packing and Capacity Management, Chair: Eugene Zak, session 452 Logistics Build I, Z 7 2nd floor 3x20 min Marina Andretta, Solving Irregular Strip Packing Problems with free rotations Alexandre Le Jean, A 3D-knapsack prob- lem with truncated pyramids and static sta- bility constraint Eugene Zak, Minimization of sum of in- verse sawtooth functions Salle 18 Manufacturing, Chair: Younsoo Lee, session 530 Scheduling Build I, Z 7 1st floor 4x20 min S´ebastien Beraudy, Detailed production planning models for semiconductor man- ufacturing with profit Teun Janssen, Scheduling in the Pho- tolithography Bay Hugo Harry Kramer, Column generation and fix-and-optimize for the lot-sizing with remanufacturing Younsoo Lee, On the discrete lot-sizing and scheduling problem with sequence- dependent setup Salle 23 Novel data-driven OR techniques for power system operations and planning, Organizer: Juan M. Morales, session 52 Energy Build G, Z 6 3rd floor 3x30 min Salvador Pineda Morente, Chronological Time-Period Clustering for Optimal Ca- pacity Expansion Planning Christos Ordoudis, Energy and Re- serve Dispatch with Distributionally Ro- bust Joint Chance Constraints Juan Morales, Predicting the electricity demand response via data-driven inverse optimization Salle 24 Structure and Learning in Power Grid Optimization, Organizer: Deepjyoti Deka, session 135 Energy Build G, Z 6 3rd floor 3x30 min Gal Dalal, Chance-Constrained Outage Scheduling using a Machine Learning Proxy Sidhant Misra, Statistical Learning For DC Optimal Power Flow Apurv Shukla, Non-Stationary Streaming PCA Salle LA4 Structure from evidence, Organizer: Peter Gritzmann, session 386 Sciences Build L, Z 8 Basement 3x30 min Douglas Gon¸calves, Mathematical Pro- gramming in Quantum Information and Computation Jorge Barreras, Detection of Uninformed Experts Peter Gritzmann, On constrained flow and multi assignment problems for plasma par- ticle tracking PITRES Implementation of interior-point methods for large-scale problems and applications II, Organizer: Jordi Castro, session 352 Algo Build O, Z 8 Ground Floor 3x30 min Csaba Meszaros, On the implementation of the crossover algorithm Aurelio Oliveira, Interior point methods applied to context-free grammar parameter estimation Jordi Castro, A new specialized interior- point method for support vector machines Room Discrete Optimization & Integer Programming - Tuesday 8:30 AM – 10:30 AM Salle 43 Extended formulations, Organizer: Stefan Weltge, session 219 IPtheory Build C, Z 1 3rd floor 4x30 min Michele Conforti, Balas formulation for the union of polytopes is optimal Tony Huynh, Strengthening Convex Re- laxations of 0 /1-Sets Using Boolean For- mulas Makrand Sinha, Lower Bounds for Ap- proximating the Matching Polytope Stefan Weltge, Lifting Linear Extension Complexity Bounds to the Mixed-Integer Setting Salle 34 MIP under Uncertainty 1, Organizer: Fatma Kilinc-Karzan, session 231 IPtheory Build B, Z 3 1st floor 3x30 min Shabbir Ahmed, Distributionally Robust Combinatorial Optimization Simge Kucukyavuz, Risk-Averse Set Cov- ering Problems Ruiwei Jiang, Mixed-Integer Recourse via Prioritization Salle 35 Cutting Planes for Integer Programs, Chair: Matthias Köppe, session 512 IPtheory Build B, Z 4 Intermediate 4x30 min Jiawei Wang, Characterization and Ap- proximation of General Dual-Feasible Functions Yuan Zhou, All finite group complexity in- jects Daniel Porumbel, Projective cutting- planes by projecting interior points onto polytope facets Matthias K¨oppe, cutgeneratingfunctionol- ogy: Python software for CGFs and super- additive duality Salle 44 Machine Learning for Optimization, Organizer: Bistra Dilkina, session 138 IPpractice Build C, Z 1 3rd floor 4x30 min Bistra Dilkina, Machine Learning for Branch and Bound Markus Kruber, Learning when to use a decomposition Elias Khalil, Learning Combinatorial Op- timization Algorithms Over Graphs Andrea Lodi, Learning Discrete Optimiza- tion LEYTEIRE Streaming, Organizer: Michael Kapralov, session 228 APPROX Build E, Z 1 3rd floor 4x30 min Eric Price, Counting subgraphs in graph streams David Woodruff, Sublinear Time Low Rank Approximation of Positive Semidefi- nite Matrices Pan Peng, Estimating Graph Parameters from Random Order Streams Michael Kapralov, (1 + Ω(1))- Approximation to MAX-CUT Requires Linear Space Salle 36 Approximation Algorithms for Clustering, Organizer: Chaitanya Swamy, session 256 APPROX Build B, Z 4 Intermediate 4x30 min Sara Ahmadian, Better Guarantees for k- Means Problem using Primal-Dual Algo- rithms Chris Schwiegelshohn, On the Local Structure of Stable Clustering Instances Benjamin Moseley, Approximation Bounds for Hierarchical Clustering Chaitanya Swamy, Unifying k-Median and k-Center: Approximation Algorithms for Ordered k-Median SIGALAS Matching games and beyond, Organizer: Jochen Koenemann, session 241 COMB Build C, Z 2 2nd floor 4x30 min Zhuan Khye Koh, Stabilizing Weighted Graphs Justin Toth, Computing the Nucleolus of Weighted Cooperative Matching Games in Poly Time Jannik Matuschke, New and simple algo- rithms for stable flow problems Agnes Cseh, The complexity of cake cut- ting with unequal shares Salle 41 Equilibrium Computation in Congestion Games, Organizer: Umang Bhaskar, session 242 COMB Build C, Z 1 3rd floor 4x30 min Ioannis Panageas, Multiplicative Weights Update with Constant Step-Size in Con- gestion Games Tobias Harks, Equilibrium Computation in Resource Allocation Games Guido Sch¨afer, Computing Efficient Nash Equilibria in Congestion Games Umang Bhaskar, Equilibrium Computa- tion in Atomic Splittable Routing Games with Convex Costs Salle 39 Exact approaches for problems over lattices and graphs, Chair: Daniele Catanzaro, session 425 COMB Build E, Z 1 3rd floor 4x30 min Austin Buchanan, Why is maximum clique often easy in practice? Matteo Cosmi, Scheduling for Last-Mile Food Delivery Martin Frohn, Optimizing over lattices of unrooted binary trees: Part I - Foundations Daniele Catanzaro, Optimizing over lat- tices of unrooted binary trees: Part II - On the BMEP DURKHEIM Graphical Optimization Model 1, Organizer: Joris Kinable, session 295 CP Build A, Z 1 3rd floor 4x30 min David Bergman, On the integrated last mile transportation problem Willem-Jan van Hoeve, Cut Generation for Integer (Non-)Linear Programming via Decision Diagrams Joris Kinable, Hybrid Optimization Meth- ods for Time-Dependent Sequencing Prob- lems John Hooker, Compact Representation of Near-Optimal Integer Programming Solu- tions 73 Yüklə 23,3 Mb. Dostları ilə paylaş:
|