1. "Make no little plans": Impactful research to solve the next generation of transportation problems. Issue 2 (16th November 2020) Authors: Agatz, Niels; Hewitt, Mike; Thomas, Barrett W. Journal: Networks Issue: Volume 77:Issue 2(2021) Page Start: 269 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
2. 2014/2015 survey on University of Maribor as a sustainable and socially responsible university. (2015) Authors: Mulej, Matjaž; Čagran, Branka Journal: International journal of markets and business systems Issue: Volume 1:Number 4(2015) Page Start: 275 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
3. 2019–2020 Glover‐Klingman Prize Winners. Issue 4 (26th June 2021) Authors: Golden, Bruce L.; Shier, Douglas R. Journal: Networks Issue: Volume 79:Issue 4(2022) Page Start: 431 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
4. A biased‐randomized metaheuristic for the vehicle routing problem with clustered and mixed backhauls. Issue 3 (17th March 2017) Authors: Belloso, Javier; Juan, Angel A.; Martinez, Enoc; Faulin, Javier Journal: Networks Issue: Volume 69:Issue 3(2017) Page Start: 241 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
5. A branch‐and‐bound algorithm for representative integer efficient solutions in multiple objective network programming problems. Issue 1 (7th January 2013) Authors: Sun, Minghe Journal: Networks Issue: Volume 62:Issue 1(2013:Aug.) Page Start: 56 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
6. A branch‐and‐bound algorithm for the double travelling salesman problem with two stacks. Issue 1 (19th May 2012) Authors: Carrabs, Francesco; Cerulli, Raffaele; Speranza, Maria Grazia Journal: Networks Issue: Volume 61:Issue 1(2013:Jan.) Page Start: 58 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
7. A branch‐and‐bound algorithm for the time‐dependent travelling salesman problem. Issue 3 (19th June 2018) Authors: Arigliano, Anna; Calogiuri, Tobia; Ghiani, Gianpaolo; Guerriero, Emanuela Journal: Networks Issue: Volume 72:Issue 3(2018) Page Start: 382 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
8. A branch‐and‐cut algorithm for a bipartite graph construction problem in digital communication systems. Issue 2 (6th December 2019) Authors: Kabakulak, Banu; Taşkin, Z. Caner; Pusane, Ali E. Journal: Networks Issue: Volume 75:Issue 2(2020) Page Start: 137 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
9. A branch‐and‐cut algorithm for the multi‐vehicle traveling purchaser problem with pairwise incompatibility constraints. Issue 2 (3rd December 2014) Authors: Manerba, Daniele; Mansini, Renata Journal: Networks Issue: Volume 65:Issue 2(2015:Mar.) Page Start: 139 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
10. A branch‐and‐cut algorithm for the pickup‐and‐delivery traveling salesman problem with handling costs. Issue 3 (9th April 2022) Authors: Radha Krishnan, Devaraj; Liu, Tieming Journal: Networks Issue: Volume 80:Issue 3(2022) Page Start: 297 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗