- Mohamed Ben Ahmed, Maryia Hryhoryeva, Lars Magnus Hvattum, Mohamed Haouari. A matheuristic for the robust integrated airline fleet assignment, aircraft routing, and crew pairing problem. Computers & OR, 137:105551, 2022.
- Emanuel Florentin Olariu, Cristian Frasinaru. Improving lower bounds for equitable chromatic number. Computers & OR, 143:105790, 2022.
- Pedro Miranda, Jean-François Cordeau, Emma Frejinger. A time-space formulation for the locomotive routing problem at the Canadian National Railways. Computers & OR, 139:105629, 2022.
- Pengfei He, Jin-Kao Hao. Hybrid search with neighborhood reduction for the multiple traveling salesman problem. Computers & OR, 142:105726, 2022.
- Chuang Zhang, Yantong Li, Junhai Cao, Xin Wen. On the mass COVID-19 vaccination scheduling problem. Computers & OR, 141:105704, 2022.
- Mohamed Lemine Ahmed Sidi, Ronan Bocquillon, Hafedh Mohamed-Babou, Cheikh Dhib, Emmanuel Néron, Ameur Soukhal, Mohamedade Farouk Nanne. Improved approaches to solve the One-To-One SkewGraM problem. Computers & OR, 138:105584, 2022.
- Janne Kettunen, Miguel A. Lejeune. Data-driven project portfolio selection: Decision-dependent stochastic programming formulations with reliability and time to market requirements. Computers & OR, 143:105737, 2022.
- Gilbert Laporte, Marie-Eve Rancourt, Jessica Rodríguez-Pereira, Selene Silvestri. Optimizing access to drinking water in remote areas. Application to Nepal. Computers & OR, 140:105669, 2022.
- Valentina Cacchiani, Manuel Iori, Alberto Locatelli, Silvano Martello. Knapsack problems - An overview of recent advances. Part I: Single knapsack problems. Computers & OR, 143:105692, 2022.
- Richard L. Church, Zvi Drezner. Review of obnoxious facilities location problems. Computers & OR, 138:105468, 2022.