default search action
Networks, Volume 63
Volume 63, Number 1, January 2014
- Ann Melissa Campbell, Jill Hardin Wilson:
Forty years of periodic vehicle routing. 2-15 - Claudia Archetti, Nicola Bianchessi, Maria Grazia Speranza, Alain Hertz:
The split delivery capacitated team orienteering problem. 16-33 - Hipólito Hernández-Pérez, Juan José Salazar González:
The multi-commodity pickup-and-delivery traveling salesman problem. 46-59 - Attila A. Kovacs, Sophie N. Parragh, Richard F. Hartl:
A template-based adaptive large neighborhood search for the consistent vehicle routing problem. 60-81 - Pamela C. Nolz, Nabil Absi, Dominique Feillet:
A stochastic inventory routing problem for infectious medical waste collection. 82-95 - Jiani Qian, Richard W. Eglese:
Finding least fuel emission paths in a network with time-varying speeds. 96-106 - Minh Hoàng Hà, Nathalie Bostel, André Langevin, Louis-Martin Rousseau:
Solving the close-enough arc routing problem. 107-118 - Michael Drexl:
Branch-and-cut algorithms for the vehicle routing problem with trailers and transshipments. 119-133
Volume 63, Number 2, March 2014
- Claudia Archetti, Nicola Bianchessi, Maria Grazia Speranza, Alain Hertz:
Incomplete service and split deliveries in a routing problem with profits. 135-145 - Jason I. Brown, Danielle Cox:
Nonexistence of optimal graphs for all terminal reliability. 146-153 - Mojtaba Araghi, Oded Berman, Igor Averbakh:
Minisum multipurpose trip location problem on trees. 154-159 - In-Jae Kim, Brian P. Barthel, Yuyoung Park, Jordan R. Tait, Joseph L. Dobmeier, Sung Kim, Dooyoung Shin:
Network analysis for active and passive propagation models. 160-169 - André Berger, Alexander Grigoriev, Ruben van der Zwaan:
Complexity and approximability of the k-way vertex cut. 170-178 - Zhou Xu, Xiaofan Lai, Andrew Lim, Fan Wang:
An improved approximation algorithm for the capacitated TSP with pickup and delivery on a tree. 179-195 - Natashia Boland, Reena Kapoor, Simranjit Kaur, Thomas Kalinowski:
Scheduling unit time arc shutdowns to maximize network flow over time: Complexity results. 196-202 - Fabiano de S. Oliveira, Valmir Carneiro Barbosa:
Revisiting deadlock prevention: A probabilistic approach. 203-210
Volume 63, Number 3, May 2014
- Dominique Feillet, Thierry Garaix, Fabien Lehuédé, Olivier Péton, Dominique Quadri:
A new consistent vehicle routing problem for the transportation of people with disabilities. 211-224 - Xiang-Jun Li, Jun-Ming Xu:
Generalized measures for fault tolerance of star networks. 225-230 - Masayuki Kobayashi, Yoshio Okamoto:
Submodularity of minimum-cost spanning tree games. 231-238 - Olivia J. Smith, Martin W. P. Savelsbergh:
A note on shortest path problems with forbidden paths. 239-242 - Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni:
Fully dynamic update of arc-flags. 243-259 - Amit Verma, Ann Melissa Campbell:
Strategic placement of telemetry to reduce routing costs. 260-275
- Ann Melissa Campbell, Jill Hardin Wilson:
Forty years of periodic vehicle routing. 276
Volume 63, Number 4, July 2014
- Endre Boros, Pinar Heggernes, Pim van 't Hof, Martin Milanic:
Vector connectivity in graphs. 277-285 - Chi Xie:
Bicriterion discrete equilibrium network design problem. 286-305 - Sarah G. Nurre, Thomas C. Sharkey:
Integrated network design and scheduling problems with parallel identical machines: Complexity results and dispatching rules. 306-326 - Ahmad Moradi, Andrea Lodi, S. Mehdi Hashemi:
On the difficulty of virtual private network instances. 327-333 - Igor Averbakh, Oded Berman, Dmitry Krass, Jörg Kalcsics, Stefan Nickel:
Cooperative covering problems on networks. 334-349 - Stefan Gollowitzer, Luis Eduardo Neves Gouveia, Gilbert Laporte, Dilson Lucas Pereira, Adam Wojciechowski:
A comparison of several models for the hamiltonian p-median problem. 350-363
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.