11. A branch‐and‐cut algorithm for the ring spur assignment problem. Issue 2 (28th January 2013) Authors: Fortz, B.; Carroll, Paula; Fortz, Bernard; Labbé, Martine; McGarraghy, Seán; Gouveia, Luis; Voß, Stefan Journal: Networks Issue: Volume 61:Issue 2(2013:Mar.) Page Start: 89 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
12. A branch‐and‐cut approach and alternative formulations for the traveling salesman problem with drone. Issue 2 (22nd June 2020) Authors: Schermer, Daniel; Moeini, Mahdi; Wendt, Oliver Journal: Networks Issue: Volume 76:Issue 2(2020) Page Start: 164 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
13. A branch‐and‐cut approach for the least cost influence problem on social networks. Issue 1 (10th April 2020) Authors: Günneç, Dilek; Raghavan, S.; Zhang, Rui Journal: Networks Issue: Volume 76:Issue 1(2020) Page Start: 84 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
14. A branch‐and‐cut‐and‐price algorithm for the mixed capacitated general routing problem. Issue 3 (22nd August 2016) Authors: Bach, Lukas; Lysgaard, Jens; Wøhlk, Sanne Journal: Networks Issue: Volume 68:Issue 3(2016) Page Start: 161 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
15. A branch‐and‐dive heuristic for single vehicle snow removal. Issue 4 (7th September 2020) Authors: Hajizadeh, Roghayeh; Holmberg, Kaj Journal: Networks Issue: Volume 76:Issue 4(2020) Page Start: 509 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
16. A branch‐and‐price algorithm for the (k, c)‐coloring problem. Issue 4 (27th November 2014) Authors: Malaguti, Enrico; Méndez‐Díaz, Isabel; José Miranda‐Bront, Juan; Zabala, Paula Journal: Networks Issue: Volume 65:Issue 4(2015:Jul.) Page Start: 353 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
17. A branch‐and‐price algorithm for the multivehicle covering tour problem. Issue 3 (15th September 2014) Authors: Jozefowiez, Nicolas Journal: Networks Issue: Volume 64:Issue 3(2014:Oct.) Page Start: 160 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
18. A branch‐and‐price algorithm for the rainbow cycle cover problems. Issue 1 (29th November 2018) Authors: Yüceoğlu, Birol; Şahin, Güvenç Journal: Networks Issue: Volume 74:Issue 1(2019) Page Start: 3 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
19. A branch‐and‐price algorithm for the single‐path virtual network embedding problem. Issue 3 (18th December 2017) Authors: Moura, Leonardo F.S.; Gaspary, Luciano P.; Buriol, Luciana S. Journal: Networks Issue: Volume 71:Issue 3(2018) Page Start: 188 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
20. A branch‐and‐price algorithm for the vehicle routing problem with time windows on a road network. Issue 4 (15th September 2018) Authors: Ben Ticha, Hamza; Absi, Nabil; Feillet, Dominique; Quilliot, Alain; Van Woensel, Tom Journal: Networks Issue: Volume 73:Issue 4(2019) Page Start: 401 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗