- Jan Brinkmann, Marlin W. Ulmer, Dirk C. Mattfeld. Dynamic Lookahead Policies for Stochastic-Dynamic Inventory Routing in Bike Sharing Systems. Computers & OR, 106:260-279, 2019.
- Zhenzhen Zhang, Brenda Cheang, Chongshou Li, Andrew Lim. Multi-commodity demand fulfillment via simultaneous pickup and delivery for a fast fashion retailer. Computers & OR, 103:81-96, 2019.
- Eduardo Álvarez-Miranda, Markus Sinnl. An exact solution framework for the multiple gradual cover location problem. Computers & OR, 108:82-96, 2019.
- Irce F. G. Guimarães, Yassine Ouazene, Maurício C. de Souza, Farouk Yalaoui. Flowshop scheduling problem with parallel semi-lines and final synchronization operation. Computers & OR, 108:121-133, 2019.
- Tobia Calogiuri, Gianpaolo Ghiani, Emanuela Guerriero, Renata Mansini. A branch-and-bound algorithm for the time-Dependent rural postman problem. Computers & OR, 102:150-157, 2019.
- Zachary Steever, Mark H. Karwan, Chase C. Murray. Dynamic courier routing for a food delivery service. Computers & OR, 107:173-188, 2019.
- Mouna Kchaou Boujelben, Céline Gicquel. Efficient solution approaches for locating electric vehicle fast charging stations under driving range uncertainty. Computers & OR, 109:288-299, 2019.
- Bayan Hamdan, Ali Diabat. A two-stage multi-echelon stochastic blood supply chain problem. Computers & OR, 101:130-143, 2019.
- Michal K. Tomczyk, Milosz Kadzinski. EMOSOR: Evolutionary multiple objective optimization guided by interactive stochastic ordinal regression. Computers & OR, 108:134-154, 2019.
- Mehmet Gülsen, Chase C. Murray, Alice E. Smith. Double-row facility layout with replicate machines and split flows. Computers & OR, 108:20-32, 2019.