| 708 | -- | 722 | Atefeh Rajabalizadeh, Danial Davarnia. Solving a Class of Cut-Generating Linear Programs via Machine Learning |
| 723 | -- | 741 | Marleen Balvert. Iterative Rule Extension for Logic Analysis of Data: An MILP-Based Heuristic to Derive Interpretable Binary Classifiers from Large Data Sets |
| 742 | -- | 765 | Jindong Qin, Pan Zheng, Xiaojun Wang 0002. Product Redesign and Innovation Based on Online Reviews: A Multistage Combined Search Method |
| 766 | -- | 786 | Opher Baron, Dmitry Krass, Arik Senderovich, Eliran Sherzer. GI/1 Queue |
| 787 | -- | 819 | Mehdi Behroozi. Largest Volume Inscribed Rectangles in Convex Sets Defined by Finite Number of Inequalities |
| 820 | -- | 835 | Yongzheng Dai, Chen Chen 0026. Sparsity-Exploiting Distributed Projections onto a Simplex |
| 836 | -- | 848 | Danny Hermelin, Hendrik Molter, Dvir Shabtay. Minimizing the Weighted Number of Tardy Jobs via (max,+)-Convolutions |
| 849 | -- | 867 | Shanshan Wang, Erick Delage. A Column Generation Scheme for Distributionally Robust Multi-Item Newsvendor Problems |
| 868 | -- | 883 | Jasper van Doornmalen, Christopher Hojny. Efficient Propagation Techniques for Handling Cyclic Symmetries in Binary Programs |
| 884 | -- | 899 | Xiaoyi Gu, Santanu S. Dey, Jean-Philippe P. Richard. Solving Sparse Separable Bilinear Programs Using Lifted Bilinear Cover Inequalities |
| 900 | -- | 917 | Benoit Loger, Alexandre Dolgui, Fabien Lehuédé, Guillaume Massonnet. Approximate Kernel Learning Uncertainty Set for Robust Combinatorial Optimization |
| 918 | -- | 937 | Ankit Bansal, Jean-Philippe P. Richard, Bjorn P. Berg, Yu-Li Huang. A Sequential Follower Refinement Algorithm for Robust Surgery Scheduling |