default search action
Networks, Volume 73
Volume 73, Number 1, January 2019
- Babak Saleck Pay, Jason R. W. Merrick, Yongjia Song:
Stochastic network interdiction with incomplete preference. 3-22 - Cristina Bazgan, Till Fluschnik, André Nichterlein, Rolf Niedermeier, Maximilian Stahlberg:
A more fine-grained complexity analysis of finding the most vital edges for undirected shortest paths. 23-37 - Jorge Moreno, Simone Martins, Yuri Frota:
A note on the rainbow cycle cover problem. 38-47 - Jose L. Walteros, Alexander Veremyev, Panos M. Pardalos, Eduardo L. Pasiliao:
Detecting critical node structures on graphs: A mathematical programming approach. 48-88 - Marcus Brazil, Marcus Volz, Martin Zachariasen, Charl J. Ras, Doreen A. Thomas:
Computing minimum 2-edge-connected Steiner networks in the Euclidean plane. 89-103 - Basak Altan, Okan Örsan Özener:
Cost allocation mechanisms in a peer-to-peer network. 104-118 - Bahar Çavdar, Joel Sokol:
A computation-implementation parallelization approach to the vehicle loading and routing problem. 119-134 - Hamidreza Validi, Austin Buchanan:
A note on "A linear-size zero-one programming model for the minimum spanning tree problem in planar graphs". 135-142
Volume 73, Number 2, March 2019
- Oylum Seker, Tínaz Ekim, Z. Caner Taskin:
A decomposition approach to solve the selective graph coloring problem in some perfect graph families. 145-169 - Dorit S. Hochbaum:
Algorithms and complexity of range clustering. 170-186 - Barrett W. Thomas, Tobia Calogiuri, Mike Hewitt:
An exact bidirectional A⋆ approach for solving resource-constrained shortest path problems. 187-205 - Daniel Rehfeldt, Thorsten Koch, Stephen J. Maher:
Reduction techniques for the prize collecting Steiner tree problem and the maximum-weight connected subgraph problem. 206-233 - Mikael Capelle, Marie-José Huguet, Nicolas Jozefowiez, Xavier Olive:
Optimizing ground station networks for free space optical communications: Maximizing the data transfer. 234-253 - Christopher Richards, Dinesh P. Mehta:
Navigating free-floating minefields via time-varying Voronoi graphs. 254-274
Volume 73, Number 3, April 2019
- Marlin W. Ulmer:
Anticipation versus reactive reoptimization for dynamic vehicle routing with stochastic requests. 277-291 - Sevnaz Nourollahi, Archis Ghate:
Inverse optimization in minimum cost flow problems on countably infinite networks. 292-305 - Martin Groß, Marc E. Pfetsch, Lars Schewe, Martin Schmidt, Martin Skutella:
Algorithmic results for potential-based flows: Easy and hard cases. 306-324 - Michael Redmond, Ann M. Campbell, Jan Fabian Ehmke:
The most reliable flight itinerary problem. 325-343 - Didem Gözüpek, Mordechai Shalom:
Complexity of edge coloring with minimum reload/changeover costs. 344-357 - Christopher Richards, Christopher Odom, David P. Morton, Alexandra M. Newman:
Minimum-risk routing through a mapped minefield. 358-376
Volume 73, Number 4, June 2019
Preface
- Maciek Nowak, Claudia Archetti, Bogumil Kaminski:
Preface: Special issue on the future of route optimization/vehicle routing. 379-381
- Piotr Matl, Richard F. Hartl, Thibaut Vidal:
Leveraging single-objective heuristics to solve bi-objective problems: Heuristic box splitting and its application to vehicle routing. 382-400 - Hamza Ben Ticha, Nabil Absi, Dominique Feillet, Alain Quilliot, Tom Van Woensel:
A branch-and-price algorithm for the vehicle routing problem with time windows on a road network. 401-417 - Daniel Merchán, Matthias Winkenbach:
An empirical validation and data-driven extension of continuum approximation approaches for urban route distances. 418-433 - Bing Yao, Caitlin McLean, Hui Yang:
Robust optimization of dynamic route planning in same-day delivery networks with one-time observation of new demand. 434-452 - Huan Jin, Barrett W. Thomas:
Team orienteering with uncertain rewards and service times with an application to phlebotomist intrahospital routing. 453-465 - Shu Zhang, Ann M. Campbell, Jan Fabian Ehmke:
Impact of congestion pricing schemes on costs and emissions of commercial fleets in urban areas. 466-489 - Margaretha Gansterer, Richard F. Hartl, Rudolf Vetschera:
The cost of incentive compatibility in auction-based mechanisms for carrier collaboration. 490-514
- Appreciation to Referees. 515
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.