- Kartik Kulkarni, Manish Bansal. Discrete multi-module capacitated lot-sizing problems with multiple items. Oper. Res. Lett., 50(2):168-175, 2022.
- Katrin Heßler, Stefan Irnich. A note on the linearity of Ratliff and Rosenthal's algorithm for optimal picker routing. Oper. Res. Lett., 50(2):155-159, 2022.
- Andrés Cristi, Marc Schröder 0002. Negative prices in network pricing games. Oper. Res. Lett., 50(2):99-106, 2022.
- Minh N. Bùi. A decomposition method for solving multicommodity network equilibria. Oper. Res. Lett., 50(1):40-44, 2022.
- Xiangyang Huang, Shudong Zhang, Lijuan Zhou, LiGuo Huang. A hybrid algorithm for the minimum bounding sphere problem. Oper. Res. Lett., 50(2):150-154, 2022.
- Zhongzheng Tang, Chenhao Wang 0001, Hau Chan. k-submodular function under a knapsack constraint. Oper. Res. Lett., 50(1):28-31, 2022.
- Luca Accorsi, Andrea Lodi 0001, Daniele Vigo. Guidelines for the computational testing of machine learning approaches to vehicle routing problems. Oper. Res. Lett., 50(2):229-234, 2022.
- Sharmila V. S. Duppala, Karthik Abinav Sankararaman, Pan Xu 0001. Online minimum matching with uniform metric and random arrivals. Oper. Res. Lett., 50(1):45-49, 2022.
- Yotaro Takazawa. Approximation algorithm for the stochastic prize-collecting set multicover problem. Oper. Res. Lett., 50(2):224-228, 2022.
- Bo Li 0037, Chenhao Wang 0001, Ruilong Zhang. A note on the online interval scheduling secretary problem. Oper. Res. Lett., 50(1):72-75, 2022.