Discrete Optimization Talks

External homepage

optimization and control

Audience: Researchers in the topic
Seminar series times: Tuesday 18:00-18:30, 18:30-19:00 in your time zone, UTC
Organizers: Discrete Optimization Talks*, Aleksandr M. Kazachkov, Elias B. Khalil
*contact for this listing

DOTs are virtual discrete optimization talks, organized by Aleksandr M. Kazachkov and Elias B. Khalil. To receive updates about upcoming DOTs, please join our mailing list. Topics of interest include theoretical, computational, and applied aspects of integer and combinatorial optimization.

The format is a weekly session with two thirty-minute talks and time for questions. Currently, the seminars are scheduled on Tuesdays at 2:00 p.m. ET. A special feature of DOTs will be a social component. After a usual talk, you might grab a tea/coffee and chat with other attendees. Why not here too? Join us for some informal discussion after each DOT and throughout the week on our Discord channel.

Upcoming talks
Past talks
Your timeSpeakerTitle
TueJul 1418:00Jannis KurtzDiscrete Optimization Methods for Group Model Selection in Compressed Sensing
TueJul 0718:30Aida KhajaviradThe ratio-cut polytope and K-means clustering
TueJul 0718:00Amitabh BasuProvable complexity bounds for integer programming algorithms
TueJun 3018:30Jean PauphiletA Unified Approach to Mixed-Integer Optimization: Nonlinear Formulations and Scalable Algorithms
TueJun 3018:00Timo BertholdLearning to Scale
TueJun 2318:30Austin BuchananImposing contiguity constraints in political districting models
TueJun 2318:00Ricardo FukasawaEnforcing non-anticipativity in a two-stage stochastic program for scheduling with endogenous uncertainties
TueJun 1618:30Dolores Romero MoralesOn Enhancing the Interpretability of Data Science Models via Dimensionality Reduction
TueJun 1618:00Axel ParmentierLearning to approximate industrial problems by operations research classic problems
TueJun 0218:30Andrés GómezOutlier detection in time series via mixed-integer conic quadratic optimization
TueJun 0218:00Weijun XieBest Submatrix Selection: Strong Formulations and Approximation Algorithms
TueMay 2618:30Phebe VayanosActive preference elicitation via adjustable robust optimization
TueMay 2618:00Hadi CharkhgardThe magic of Nash social welfare in optimization: Do not sum, just multiply!
TueMay 1218:35Hussein HazimehSparse regression at scale: branch-and-bound rooted in first-order optimization
TueMay 1218:00Simge KüçükyavuzDistributionally Robust Chance-Constrained Programs with Right-Hand Side Uncertainty under Wasserstein Ambiguity
TueMay 0518:35Margarita CastroA Combinatorial Cut-and-Lift Procedure with an Application to 0-1 Chance Constraints
TueMay 0518:00Beste BasciftciAdaptive two-stage stochastic programming with an application to capacity expansion planning
TueApr 2818:35Siqian ShenNew Results and Applications of Facility Location involving Competition, Prioritization, or Decision-dependent Demand
TueApr 2818:00Sriram SankaranarayananWhen Nash Meets Stackelberg
TueApr 2118:35Pierre Le BodicEstimating the Size of Branch-and-Bound Trees
TueApr 2118:00Hamed RahimianA Model of Supply-Chain Decisions for Resource Sharing with an Application to Ventilator Allocation to Combat COVID-19
Embed this schedule
Export series to