Journal: Networks

Volume 58, Issue 4

239 -- 240Oli B. G. Madsen, Stefan Ropke. ROUTE 2009: Recent advances in vehicle routing optimization
241 -- 254Claudia Archetti, Nicola Bianchessi, Maria Grazia Speranza. A column generation approach for the split delivery vehicle routing problem
255 -- 272Enrique Benavent, Angel Corberán, Isaac Plana, José M. Sanchis. K-vehicles windy rural postman problem
273 -- 289Anders Dohn, Matias Sevel Rasmussen, Jesper Larsen. The vehicle routing problem with time windows and temporal dependencies
290 -- 300Richard Lusby, Jesper Larsen. Improved exact method for the double TSP with multiple stacks
301 -- 310Guy Desaulniers, Jacques Desrosiers, Simon Spoorendonk. Cutting planes for branch-and-price algorithms
311 -- 322Min Wen, Emil Krapper, Jesper Larsen, Thomas K. Stidsen. A multilevel variable neighborhood search heuristic for a practical vehicle routing and driver scheduling problem

Volume 58, Issue 3

159 -- 170Christopher Groër, Blair D. Sullivan, Steve Poole. A mathematical analysis of the R-MAT random graph generator
171 -- 189Abraham Duarte, Rafael Martí, Mauricio G. C. Resende, Ricardo M. A. Silva. GRASP with path relinking heuristics for the antibandwidth problem
190 -- 200Behrooz Alizadeh, Rainer E. Burkard. Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees
201 -- 206Camino Balbuena, Diego González-Moreno, Julian Salas. Edge-superconnectivity of semiregular cages with odd girth
207 -- 231Jérémie Chalopin, Daniël Paulusma. Graph labelings derived from models in distributed computing: A complete complexity classification
232 -- 237Peter D. Johnson Jr., Peter Slater, Matt Walsh. The connected hub number and the connected domination number

Volume 58, Issue 2

81 -- 82Bernard Fortz, Luce Brotcorne. Editorial: Preface to the Special Issue
83 -- 94Shoshana Anily, Michel Gendreau, Gilbert Laporte. The preemptive swapping problem on a tree
95 -- 102Mustapha Aouchiche, Pierre Hansen. Proximity and remoteness in graphs: Results and conjectures
103 -- 113Claudio Arbib, Martine Labbé, Mara Servilio. Scheduling two chains of unit jobs on one machine: A polyhedral study
114 -- 124Teodor Gabriel Crainic, Xiaorui Fu, Michel Gendreau, Walter Rei, Stein W. Wallace. Progressive hedging-based metaheuristics for stochastic network design
125 -- 136Corinne Feremans, Martine Labbé, Adam N. Letchford, Juan José Salazar González. Generalized network design polyhedra
137 -- 146Patrick Jaillet, Xin Lu. Online traveling salesman problems with service flexibility
147 -- 158Justo Puerto, Federica Ricca, Andrea Scozzari. Minimax regret path location on trees

Volume 58, Issue 1

1 -- 11Oded Berman, Zvi Drezner, Dmitry Krass. Big segment small segment global optimization algorithm on networks
12 -- 19Junho Chang, Soo Y. Chang, Sung-Pil Hong, Yun-Hong Min, Myoung-Ju Park. Approximation of a batch consolidation problem
20 -- 35Jean-Claude Bermond, Xavier Muñoz, Ignasi Sau. Traffic grooming in bidirectional WDM ring networks
36 -- 42Bilal Khan, Kiran R. Bhutani. Compression and expansion in graphs using overlays
43 -- 49Roberto Barrera, Daniela Ferrero. Power domination in cylinders, tori, and generalized Petersen graphs
50 -- 58Roel Leus. Resource allocation by means of project networks: Dominance results
59 -- 67Roel Leus. Resource allocation by means of project networks: Complexity results
68 -- 80Daniel Reich, Leo Lopes. The most likely path on series-parallel networks