- 2022
- Omar Abbaas
, José A. Ventura:
An edge scanning method for the continuous deviation-flow refueling station location problem on a general network. Networks 79(3): 264-291 (2022) - Yogesh Kumar Agarwal, Prahalad Venkateshan:
New valid inequalities for the symmetric vehicle routing problem with simultaneous pickup and deliveries. Networks 79(4): 537-556 (2022) - Maimoonah Ahmed, Ben Cameron:
The node cop-win reliability of unicyclic and bicyclic graphs. Networks 79(2): 189-201 (2022) - Yacine Al-Najjar, Walid Ben-Ameur, Jérémie Leguay, Jocelyne Elias:
Affine routing for robust network design. Networks 79(4): 557-579 (2022) - Mario Arrieta-Prieto, Abdelrahman Ismael, Carlos Rivera-Gonzalez, John E. Mitchell:
Location of urban micro-consolidation centers to reduce the social cost of last-mile deliveries of cargo: A heuristic approach. Networks 79(3): 292-313 (2022) - Oded Berman, Jiamin Wang:
The multifacility center problems with random demand weights. Networks 79(4): 432-451 (2022) - Raquel Bernardino, Ana Paias:
The family traveling salesman problem with incompatibility constraints. Networks 79(1): 47-82 (2022) - Burak Boyaci, Thu Huong Dang, Adam N. Letchford:
On matchings, T-joins, and arc routing in road networks. Networks 79(1): 20-31 (2022) - Vlad-Florin Dragoi, Valeriu Beiu:
Fast reliability ranking of matchstick minimal networks. Networks 79(4): 479-500 (2022) - Laleh Ghalami, Daniel Grosu:
Approximation algorithms for Steiner forest: An experimental study. Networks 79(2): 164-188 (2022) - Bruce L. Golden, Douglas R. Shier:
2019-2020 Glover-Klingman Prize Winners. Networks 79(4): 431 (2022) - Evgeny Gurevsky, Dmitry Kopelevich, Sergey Kovalev, Mikhail Y. Kovalyov:
Min-sum controllable risk problems with concave risk functions of the same value range. Networks 79(1): 105-116 (2022) - Oliver Habeck, Marc E. Pfetsch:
Combinatorial acyclicity models for potential-based flows. Networks 79(1): 83-104 (2022) - Jarmo Haferkamp, Jan Fabian Ehmke:
Effectiveness of demand and fulfillment control in dynamic fleet management of ride-sharing systems. Networks 79(3): 314-337 (2022) - Kai Hoppmann-Baum:
On the Complexity of Computing Maximum and Minimum Min-Cost-Flows. Networks 79(2): 236-248 (2022) - Gökçe Kahvecioglu, David P. Morton:
Optimal hierarchical clustering on a graph. Networks 79(2): 143-163 (2022) - Mor Kaspi, Tal Raviv, Marlin W. Ulmer:
Preface: Special issue on the future of city logistics and urban mobility. Networks 79(3): 251-252 (2022) - Mor Kaspi, Tal Raviv, Marlin W. Ulmer:
Directions for future research on urban mobility and city logistics. Networks 79(3): 253-263 (2022) - Do Duc Le, Maximilian Merkert, Stephan Sorgatz, Mirko Hahn, Sebastian Sager:
Autonomous traffic at intersections: An optimization-based analysis of possible time, energy, and CO savings. Networks 79(3): 338-363 (2022) - Moira MacNeil, Merve Bodur:
Constraint programming approaches for the discretizable molecular distance geometry problem. Networks 79(4): 515-536 (2022) - Joshua T. Margolis, Yongjia Song, Scott J. Mason:
A multi-vehicle covering tour problem with speed optimization. Networks 79(2): 119-142 (2022) - Leandro do C. Martins, Daniele Tarchi, Angel A. Juan, Alessandro Fusco:
Agile optimization for a real-time facility location problem in Internet of Vehicles networks. Networks 79(4): 501-514 (2022) - Manuel Ostermeier, Andreas Heimfarth, Alexander H. Hübner:
Cost-optimal truck-and-robot routing for last-mile delivery. Networks 79(3): 364-389 (2022) - Ariel Rosenfeld:
Optimal retrieval in puzzle-based storage with heuristic search and tabulation. Networks 79(3): 390-402 (2022) - Logan A. Smith, Illya V. Hicks:
New computational approaches for the power dominating set problem: Set covering and the neighborhoods of zero forcing forts. Networks 79(2): 202-219 (2022) - Logan A. Smith, David T. Mildebrath, Illya V. Hicks:
An integer program and new lower bounds for computing the strong rainbow connection numbers of graphs. Networks 79(1): 3-19 (2022) - Kenjiro Takazawa:
The b-bibranching problem: TDI system, packing, and discrete convexity. Networks 79(1): 32-46 (2022) - Oscar Tellez, Samuel Vercraene, Fabien Lehuédé, Olivier Péton, Thibaud Monteiro:
The time-consistent dial-a-ride problem. Networks 79(4): 452-478 (2022) - Radislav Vaisman:
Finding minimum label spanning trees using cross-entropy method. Networks 79(2): 220-235 (2022) - Stefan Voigt, Heinrich Kuhn:
Crowdsourced logistics: The pickup and delivery problem with transshipments and occasional drivers. Networks 79(3): 403-426 (2022)
