- Shanshan Guo, Jiayuan Han, Wenbin Wang. Business models for public emission reduction projects. Oper. Res. Lett., 51(2):190-196, March 2023.
- Manoel B. Campêlo, Jhonata A. S. Matias. A strongly polynomial algorithm for the minimum maximum flow degree problem. Oper. Res. Lett., 51(1):67-71, January 2023.
- Aida Khajavirad. On the strength of recursive McCormick relaxations for binary polynomial optimization. Oper. Res. Lett., 51(2):146-152, March 2023.
- Abhinav Anand, Souvik Dutta, Prithwiraj Mukherjee. Platform exploitation in the sharing economy. Oper. Res. Lett., 51(1):47-53, January 2023.
- Ricardo Fukasawa, Joshua Gunter. The complexity of branch-and-price algorithms for the capacitated vehicle routing problem with stochastic demands. Oper. Res. Lett., 51(1):11-16, January 2023.
- Woo-Hyung Cho, David B. Shmoys, Shane G. Henderson. SPT optimality (mostly) via linear programming. Oper. Res. Lett., 51(1):99-104, January 2023.
- Man Yiu Tsang, Karmel S. Shehadeh, Frank E. Curtis. An inexact column-and-constraint generation method to solve two-stage robust optimization problems. Oper. Res. Lett., 51(1):92-98, January 2023.
- Jan Karel Lenstra, Nodari Vakhania. On the complexity of scheduling unrelated parallel machines with limited preemptions. Oper. Res. Lett., 51(2):187-189, March 2023.
- Jan Karel Lenstra, Vitaly A. Strusevich, Milan Vlach. A historical note on the complexity of scheduling problems. Oper. Res. Lett., 51(1):1-2, January 2023.
- Johannes O. Royset. On robustness in nonconvex optimization with application to defense planning. Oper. Res. Lett., 51(1):3-10, January 2023.