default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNetworks, Volume 77
Volume 77, Number 1, January 2021
Preface
- S. Raghavan, J. Cole Smith:
Preface. 3-4
- Bruce L. Golden, Douglas R. Shier:
Twenty-one years in the life of Networks (2000 to 2020). 5-13
- Ivan T. Frisch:
The Early Days of Networks. 14-20
- Dorit S. Hochbaum
:
Applications and efficient algorithms for integer programming problems on monotone constraints. 21-49 - Anna Nagurney:
Networks in economics and finance in Networks and beyond: A half century retrospective. 50-65 - Xingyin Wang, Edward A. Wasil:
On the road to better routes: Five decades of published research on the vehicle routing problem. 66-87 - Ángel Corberán, Richard Eglese, Geir Hasle, Isaac Plana, José María Sanchis:
Arc routing problems: A review of the past, present, and future. 88-115 - Stefan Poikonen, James F. Campbell:
Future directions in drone routing research. 116-126 - Mohd. Hafiz Hasan, Pascal Van Hentenryck:
Large-scale zone-based evacuation planning - Part I: Models and algorithms. 127-145 - Jason I. Brown, Charles J. Colbourn, Danielle Cox, Christina Graves, Lucas Mol:
Network reliability: Heading out on the highway. 146-160 - Illya V. Hicks, Boris Brimkov:
Tangle bases: Revisited. 161-172
Volume 77, Number 2, March 2021
Preface
- S. Raghavan, J. Cole Smith:
Preface. 175-176
- Ivana Ljubic:
Solving Steiner trees: Recent advances, challenges, and perspectives. 177-204 - Richard T. Wong:
Telecommunications network design: Technology impacts and future directions. 205-224 - Thomas C. Sharkey, Sarah G. Nurre Pinkley, Daniel A. Eisenberg, David L. Alderson:
In search of network resilience: An optimization-based view. 225-254 - Claudia Archetti, Luca Bertazzi:
Recent challenges in Routing and Inventory Routing: E-commerce and last-mile delivery. 255-268 - Niels A. H. Agatz, Mike Hewitt, Barrett W. Thomas:
"Make no little plans": Impactful research to solve the next generation of transportation problems. 269-286 - James B. Orlin, Xiao-Yue Gong:
A fast maximum flow algorithm. 287-321 - Richard S. Barr, Fred W. Glover, Toby Huskinson, Gary A. Kochenberger:
An extreme-point tabu-search algorithm for fixed-charge network problems. 322-340 - Mohd. Hafiz Hasan, Pascal Van Hentenryck:
Large-scale zone-based evacuation planning, Part II: Macroscopic and microscopic evaluations. 341-358
Volume 77, Number 3, April 2021
- Ilia Fridman, Mikhail Y. Kovalyov, Erwin Pesch, Andrew Ryzhikov:
Fixed interval scheduling with third-party machines. 361-371 - Kathleen D. Barnetson, Andrea C. Burgess, Jessica A. Enright, Jared Howell, David A. Pike, Brady Ryan:
The firebreak problem. 372-382 - Aissa Oudjit, Matthias F. Stallmann:
Efficient algorithms for finding 2-medians of a tree. 383-402 - Pietro Lenarda, Giorgio Gnecco, Massimo Riccaboni:
Parameter estimation in a 3-parameter p-star random graph model. 403-420 - Jérémy Omer, Michael Poss:
A polynomial algorithm for minimizing travel time in consistent time-dependent networks with waits. 421-434 - Guillaume Ducoffe, Feodor F. Dragan:
A story of diameter, radius, and (almost) Helly property. 435-453 - Martin Hoefer, Lisa Wilhelmi:
Packing returning secretaries. 454-471
- (Withdrawn) Retracted: A novel pseudo-polynomial approach for shortest paths problems. 472
Volume 77, Number 4, June 2021
Preface
- Bernard Fortz, Luis Gouveia, Christina Büsing, Markus Leitner:
Preface: Special issue on network analytics and optimization. 475-476
- Mariia Anapolska, Christina Büsing, Martin Comis, Tabea Krabs:
Minimum color-degree perfect b-matchings. 477-494 - Adrien Cambier, Matthieu Chardy, Rosa Figueiredo, Adam Ouorou, Michael Poss:
Optimizing the investments in mobile networks and subscriber migrations for a telecommunication operator. 495-519 - Carlos E. Marciano, Gladstone M. Arantes Jr., Abilio Lucena, Luidi Gelabert Simonetti, Luérbio Faria, Felipe M. G. França:
Optimizing concurrency under Scheduling by Edge Reversal. 520-537
- Artur Tomaszewski, Michal Pióro, Davide Sanvito, Ilario Filippini, Antonio Capone:
An efficient approach to optimization of semi-stable routing in multicommodity flow networks. 538-558
- Alexsander Andrade de Melo, Celina M. H. de Figueiredo, Uéverton dos Santos Souza:
On undirected two-commodity integral flow, disjoint paths and strict terminal connection problems. 559-571 - Naga Venkata C. Gudapati, Enrico Malaguti, Michele Monaci:
In search of dense subgraphs: How good is greedy peeling? 572-586 - S. Raghavan, Rui Zhang:
Weighted target set selection on trees and cycles. 587-609
- APPRECIATION TO REFEREES. 610-611
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 2025-07-21 00:41 CEST 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:
