1. "Subben׳s checklist" and the assessment of articles in mathematical optimization/operations research: In memoriam of Subhash C. Narula. (July 2016) Authors: Larsson, Torbjörn; Patriksson, Michael Journal: Computers & operations research Issue: Volume 71(2016) Page Start: 163 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
2. A 2-stage method for a field service routing problem with stochastic travel and service times. (January 2016) Authors: Binart, S.; Dejax, P.; Gendreau, M.; Semet, F. Journal: Computers & operations research Issue: Volume 65(2016) Page Start: 64 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
3. A 3D approximate hybrid algorithm for stope boundary optimization. (March 2020) Authors: Nikbin, V.; Ataee-pour, M.; Shahriar, K.; Pourrahimian, Y. Journal: Computers & operations research Issue: Volume 115(2020) Page Start: Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
4. A Bayesian Monte Carlo method for computing the Shapley value: Application to weighted voting and bin packing games. (January 2021) Authors: TOUATI, Sofiane; RADJEF, Mohammed Said; SAIS, Lakhdar Journal: Computers & operations research Issue: Volume 125(2021) Page Start: Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
5. A beam search heuristic for scheduling a single machine with release dates and sequence dependent setup times to minimize the makespan. (September 2016) Authors: Vélez-Gallego, Mario C.; Maya, Jairo; Montoya-Torres, Jairo R. Journal: Computers & operations research Issue: Volume 73(2016) Page Start: 132 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
6. A beam search heuristic for scheduling a single machine with release dates and sequence dependent setup times to minimize the makespan. (September 2016) Authors: Vélez-Gallego, Mario C.; Maya, Jairo; Montoya-Torres, Jairo R. Journal: Computers & operations research Issue: Volume 73(2016) Page Start: 132 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
7. A beam-search-based constructive heuristic for the PFSP to minimise total flowtime. (May 2017) Authors: Fernandez-Viagas, Victor; Framinan, Jose M. Journal: Computers & operations research Issue: Volume 81(2017) Page Start: 167 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
8. A Benders decomposition algorithm for demand-driven metro scheduling. (February 2022) Authors: Schettini, Tommaso; Jabali, Ola; Malucelli, Federico Journal: Computers & operations research Issue: Volume 138(2022) Page Start: Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
9. A Benders decomposition algorithm for the maximum availability service facility location problem. (January 2023) Authors: Muffak, Ali; Arslan, Okan Journal: Computers & operations research Issue: Volume 149(2023) Page Start: Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
10. A Benders decomposition based framework for solving cable trench problems. (May 2017) Authors: Calik, Hatice; Leitner, Markus; Luipersbeck, Martin Journal: Computers & operations research Issue: Volume 81(2017) Page Start: 128 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗