- Shuoguang Yang, Wei You, Zhe Zhang, Ethan X. Fang. Stochastic Compositional Optimization with Compositional Constraints. INFORMS J. Optim., 8(1):1-21, 2026.
- Alberto Del Pia, Dekun Zhou. A Semidefinite Programming Relaxation for the Sparse Integer Least Squares Problem. INFORMS J. Optim., 8(1):22-40, 2026.
- Editorial Board. INFORMS J. Optim., 8(1), 2026.
- Julien Pallage, Antoine Lesage-Landry. Wasserstein Distributionally Robust Shallow Convex Neural Networks. INFORMS J. Optim., 8(1):61-93, 2026.
- Dominic Keehan, Andrew B. Philpott, Edward J. Anderson. On the Out-of-Sample Performance of Stochastic Dynamic Programming and Model Predictive Control. INFORMS J. Optim., 8(1):41-60, 2026.
- Mitas Ray, Omid Sadeghi, Lillian J. Ratliff, Maryam Fazel. Function Design for Improved Competitive Ratio in Online Resource Allocation with Procurement Costs. INFORMS J. Optim., 7(1):20-37, 2025.
- Man Yiu Tsang, Karmel S. Shehadeh. On the Tradeoff Between Distributional Belief and Ambiguity: Conservatism, Finite-Sample Guarantees, and Asymptotic Properties. INFORMS J. Optim., 7(3):240-263, 2025.
- Nathan Atkinson, Scott C. Ganz, Dorit S. Hochbaum, James B. Orlin. The Strong Maximum Circulation Algorithm: A New Method for Aggregating Preference Rankings. INFORMS J. Optim., 7(2):142-155, 2025.
- Miju Ahn, Harsha Gangammanavar, David Troxell. Tractable Continuous Approximations for Constraint Selection via Cardinality Minimization. INFORMS J. Optim., 7(3):195-213, 2025.
- Editorial Board. INFORMS J. Optim., 7(1):2, 2025.