34:03

Madeleine Udell - AI and the future of optimization modeling

27:11

Qimeng (Kim) Yu - On constrained mixed-integer DR-submodular minimization

30:19

Jose Walteros - A branch-and-bound framework to solve interdependent multi-stage interdiction games

29:56

Karen Aardal - Machine-learning augmented branch-and-bound for mixed-integer linear optimization

28:56

Bartolomeo Stellato - Differentiable Cutting-plane Layers for Mixed-integer Linear Optimization

34:20

Marleen Balvert - IRELAND: Iterative Rule Extension for the Logical ANalysis of Data

31:30

Silvia Di Gregorio - A Knowledge Compilation Take on Binary Polynomial Optimization

29:50

Jan Kronqvist - Building upon linear MIP techniques to solve convex MINLP

45:34

Álinson Santos Xavier - MIPLearn: An Extensible Framework for Learning-Enhanced Optimization

33:05

Selvaprabu Nadarajah, Self-Adapting Network Relaxations for Weakly Coupled Markov Decision Processes

28:55

Maryam Daryalal - A hybrid logic-based Benders decomposition approach for network migration

29:28

Georgina Hall - Traceability Technology Adoption in Supply Chain Networks

33:11

Yatharth Dubey - Theoretical and Computational Analysis of Strong Branching

33:02

Marcia Fampa - Convex integer nonlinear programming for maximum-entropy sampling

27:52

Emily Tucker Mitigating Threats to Global Drug Supply: Supply Chain Design under Geopolitical Strain

37:43

Claudio Contardo - MIP-based branch-and-bound for the discrete ordered median problem

34:30

Anand Subramanian - Conference scheduling: a clustering-based approach

32:37

Harsha Nagarajan - Learning to Accelerate Partitioning-based Algorithms for Global Non-convex Opt.

29:25

Kevin Tierney - Search heuristics for solving combinatorial optimization problems with deep RL

30:48

Christopher Hojny - The role of rationality in integer programming relaxations

30:15

Joseph Paat - The column-number of a Delta-modular matrix

32:14

Anirudh Subramanyam - Branch-price-and-cut algorithms for robust vehicle routing under uncertainty

25:20

Sophie Huiberts - Combinatorial Diameter of Random Polytopes

30:20

Laura Sanità - On the Simplex method for 0/1 polytopes

28:11

Elina Rönnberg IP column generation: Accelerating branch&price for set covering/packing/partitioning

32:11

Emma Frejinger - Fast Heuristic L-Shaped Method Through Machine Learning

29:36

Swati Gupta - Reusing Combinatorial Structure for Projections over Submodular Polytopes

30:08

Alexandra Newman - Optimizing Design and Operations of Concentrated Solar Power Plants

31:08

Jorge Sefair - Continuous location models in the presence of obstacles

32:47

Michaël Poss - Optimization problems in graphs with locational uncertainty

28:57

Danial Davarnia Rectangular decomposition of MIP via decision diagrams, applicat. to unit commitment

31:42

Marc Pfetsch - Presolving for Mixed-Integer Semidefinite Optimization

31:37

Victor Zavala - Solution of Large-Scale Supply Chain Models using Graph Sampling & Coarsening

42:19

Ivana Ljubic - Lower Bounds for Ramsey Numbers on Circulant Graphs: A Bilevel Optimization Approach

30:39

Carla Michini - The Price of Anarchy in Series-Parallel Network Congestion Games

31:51

Yuri Faenza - Stable matchings, lattices, and polytopes

31:02

Ruth Misener - Partial Lasserre relaxation for sparse Max-Cut

27:36

Robert Hildebrand - Compact mixed-integer programming relaxations in quadratic optimization

33:14

Andrew Trapp- A Comparative Study of Stability Representations for Solving Many-to-One Matching Prob

31:10

Yiling Zhang- Building Load Control using Distributionally Robust Binary Chance-Constrained Programs

33:08

Thibaut Vidal - Born-Again Tree Ensembles: Seeing the Forest for the Trees

28:27

Marianna De Santis- Exact approaches for multiobjective mixed integer nonlinear programming problems

29:32

Merve Bodur - Inverse Mixed Integer Optimization: Polyhedral Insights and Trust Region Methods

29:56

Ward Romeijnders, A Converging Benders’ Decomposition Algo. for 2-Stage Mixed-Integer Recourse Model

25:41

Cheng Guo - Copositive Duality for Discrete Markets and Games

32:33

David Bernal - Modern Computational Approaches to Nonlinear Discrete Optimization and Applications

24:36

Alfredo Torrico - The Greedy Algorithm: An Effective and Flexible Tool in Submodular Optimization

32:09

Felipe Serrano - Monoidal Strengthening

24:56

Santanu Dey - Sparse PSD approximation of the PSD cone

28:31

Tuomas Sandholm - Configuring Algorithms Automatically: From Practice to Theory

37:39

Jannis Kurtz - Discrete Optimization Methods for Group Model Selection in Compressed Sensing

32:28

Amitabh Basu - Provable complexity bounds for integer programming algorithms

32:32

Aida Khajavirad - The ratio-cut polytope and K-means clustering

31:04

Jean Pauphilet A Unified Approach to Mixed-Integer Optimization Nonlinear Formulations&Scalable Algo

29:29

Timo Berthold - Learning to Scale

30:20

Ricardo Fukasawa, Non-anticipativity in two-stage stochastic scheduling w/ endogenous uncertainties

30:38

Austin Buchanan - Imposing contiguity constraints in political districting models

31:22

Dolores Romero Morales, On Enhancing Interpretability of Data Science via Dimensionality Reduction

30:07

Axel Parmentier -Learning to approximate industrial problems by operations research classic problems

30:19

Phebe Vayanos - Active Preference Elicitation via Adjustable Robust Optimization