default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNetworks, Volume 79
Volume 79, Number 1, January 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. 3-19 - Burak Boyaci, Thu Huong Dang, Adam N. Letchford:
On matchings, T-joins, and arc routing in road networks. 20-31 - Kenjiro Takazawa:
The b-bibranching problem: TDI system, packing, and discrete convexity. 32-46 - Raquel Bernardino, Ana Paias:
The family traveling salesman problem with incompatibility constraints. 47-82 - Oliver Habeck, Marc E. Pfetsch:
Combinatorial acyclicity models for potential-based flows. 83-104 - Evgeny Gurevsky, Dmitry Kopelevich, Sergey Kovalev, Mikhail Y. Kovalyov:
Min-sum controllable risk problems with concave risk functions of the same value range. 105-116
Volume 79, Number 2, March 2022
- Joshua T. Margolis, Yongjia Song, Scott J. Mason:
A multi-vehicle covering tour problem with speed optimization. 119-142 - Gökçe Kahvecioglu, David P. Morton:
Optimal hierarchical clustering on a graph. 143-163 - Laleh Ghalami, Daniel Grosu:
Approximation algorithms for Steiner forest: An experimental study. 164-188 - Maimoonah Ahmed, Ben Cameron:
The node cop-win reliability of unicyclic and bicyclic graphs. 189-201 - Logan A. Smith, Illya V. Hicks:
New computational approaches for the power dominating set problem: Set covering and the neighborhoods of zero forcing forts. 202-219 - Radislav Vaisman:
Finding minimum label spanning trees using cross-entropy method. 220-235 - Kai Hoppmann-Baum:
On the Complexity of Computing Maximum and Minimum Min-Cost-Flows. 236-248
Volume 79, Number 3, April 2022
Preface
- Mor Kaspi, Tal Raviv, Marlin W. Ulmer:
Preface: Special issue on the future of city logistics and urban mobility. 251-252
- Mor Kaspi, Tal Raviv, Marlin W. Ulmer:
Directions for future research on urban mobility and city logistics. 253-263 - Omar Abbaas, José A. Ventura:
An edge scanning method for the continuous deviation-flow refueling station location problem on a general network. 264-291 - 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. 292-313 - Jarmo Haferkamp, Jan Fabian Ehmke:
Effectiveness of demand and fulfillment control in dynamic fleet management of ride-sharing systems. 314-337 - 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. 338-363 - Manuel Ostermeier, Andreas Heimfarth, Alexander H. Hübner:
Cost-optimal truck-and-robot routing for last-mile delivery. 364-389 - Ariel Rosenfeld:
Optimal retrieval in puzzle-based storage with heuristic search and tabulation. 390-402 - Stefan Voigt, Heinrich Kuhn:
Crowdsourced logistics: The pickup and delivery problem with transshipments and occasional drivers. 403-426
- APPRECIATION TO REFEREES. 427-428
Volume 79, Number 4, June 2022
- Bruce L. Golden, Douglas R. Shier:
2019-2020 Glover-Klingman Prize Winners. 431
- Oded Berman, Jiamin Wang:
The multifacility center problems with random demand weights. 432-451 - Oscar Tellez, Samuel Vercraene, Fabien Lehuédé, Olivier Péton, Thibaud Monteiro:
The time-consistent dial-a-ride problem. 452-478 - Vlad-Florin Dragoi, Valeriu Beiu:
Fast reliability ranking of matchstick minimal networks. 479-500 - 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. 501-514 - Moira MacNeil, Merve Bodur:
Constraint programming approaches for the discretizable molecular distance geometry problem. 515-536 - Yogesh Kumar Agarwal, Prahalad Venkateshan:
New valid inequalities for the symmetric vehicle routing problem with simultaneous pickup and deliveries. 537-556 - Yacine Al-Najjar, Walid Ben-Ameur, Jérémie Leguay, Jocelyne Elias:
Affine routing for robust network design. 557-579
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.
last updated on 2024-11-22 19:42 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
