(In 2024 the Informs Optimization Society conference included, for the first time, an optional refereed venue. )
Review Comittee: Daniel Bienstock (chair), Merve Bodur, Ambros Gleixner, Viswanath Nagarajan, Joseph Paat, Daniel Robinson and Rahul Mazumdar.
Accepted submissions:
Stochastic Scheduling: Strategies for Abandonment Management, by by Yihua Xu, Rohan Ghuge, and Sebastián Perez-Salazar.
Estimating Computational Noise on Parametric Curves, by Matt Menickelly.
Interior Point Method in Tensor Optimal Transport, by Shmuel Friedland.
Inexact Proximal Splitting Methods for Euclidean Distance Matrix Optimization, by Xin Jiang and Charoui Yao.
A Study on Two-Metric Projection Methods, by Hanju Wu and Yue Xie.
Appproximate Bipartite b-Matching using Multiplicative Auction, by Bhargav Samineni, S.M. Ferdous, Mahantesh Halappanavar and Bala Krishnamoorthy.
Online Resource Allocation with Predictions, by Lin An, Andrew A. Li, Benjamin Moseley and Gabriel Visotsky.
Handling Polyhedral Symmetries with a Dedicated Branch&Cut: Application to a Knaspack Variant, by Alexandre Heintzmann, Pascale Bendotti and Cécile Rottner.
Determining Sharp Proximity Bounds for Low Row Rank and Delta-Modularity, by Matthias Köppe, Moises Reyes Rivas and Luze Xu.
Towards Large-Scale Probabilistic Set Covering Problem: and Efficient Benders Decomposition Approach, by Wei-Kun Chen, Yi-Long Chen, Yu-Hong Dai and Wei Lv.
Network Design for the Traffic Assignment Problem with Mixed-Integer Frank-Wolfe, by Kartikey Sharma, Deborah Hendrych, Mathieu Besançon and Sebastian Pokutta.
A Unifying Theory for the Reliability of Stochastic Programming Solutions using Compromise Decisions, by Shuotao Diao and Suvrajeet Sen.
Convergence Guarantees of a Distributed Network Equivalence Algorithm for Distribution-OPF, by Yunqi Luo, Rabayet Sadnan, Bala Krishnamoorthy and Anamika Dubey.
Branching in the Dual Decomposition Method for Stochastic Integer Programs, by Zhichao Ma and Jeff Linderoth.
Flexible Resource Job Scheduling -- A Mixed Integer Programming Approach, by Vanessa Ann Beddoe Sawkmie and Jeff Linderoth.
Differentially Private High Dimensional Bandits, by Apurv Shukla.
Estimate-Then-Optimize versus Integrated-Estimation-Optimization versus Sample Average Approximation: A Stochastic Dominance Perspective, by Adam N. Elmachtoub, Henry Lam, Haofeng Zhang and Yunfan Zhao.
Branch-and-Price for the Length-Constrained Cycle Partition Problem, by Mohammed Ghannam, Gioni Mexi, Edward Lam and Ambros Gleixner.
A Tuning-Free Primal-Dual Splitting Algorithm for Large-Scale Semidefinite Programming, by Yinjun Wang, Haixiang Lan and Yinyu Ye.
Accurate and Warm-Startable Linear Cutting-Plane Relaxations for ACOPF, by Daniel Bienstock and Matías Villagra.
Information Basis in Dynamic Robust Optimization, by Ningji Wei and Peter Zhang.
Conditional Generative Representation for Black-Box Optimization with Implicit Constraints, by Wenqian Xing, Jungho Lee, Chong Liu and Shixiang Zhu.